Trust establishment in the formation of Virtual Organizations.

A conditional purpose%2Dbased access control model with dynamic roles.

Proceedings of the 3rd ACM SIGSPATIAL International Workshop on Security and Privacy in GIS and LBS



Controlling data disclosure in computational PIR protocols.

Panel Description Joint COMPSAC%2FSAINT Panel Future of the Internet.

A Privacy%2DEnhancing Content%2DBased Publish%2FSubscribe System Using Scalar Product Preserving Transformations.

Publishing Time%2DSeries Data under Preservation of Privacy and Distance Orders.

Provenance%2Dbased trustworthiness assessment in sensor networks.

Private record matching using differential privacy.

How to authenticate graphs without leaking.

Privacy%2Dpreserving matching of spatial datasets with protection against background knowledge.

Credibility%2Denhanced curated database Improving the value of curated databases.

Analyzing semantic locations cloaking techniques in a probabilistic grid%2Dbased map.

Credibility%2Denhanced curated database Improving the value of curated databases.



A privacy%2Dpreserving approach to policy%2Dbased content dissemination.
We propose a novel scheme for selective distribution of content, encoded as documents, that preserves the privacy of the users to whom the documents are delivered and is based on an efficient and novel group key management scheme. Our document broadcasting approach is based on access control policies specifying which users can access which documents, or subdocuments. Based on such policies, a broadcast document is segmented into multiple subdocuments, each encrypted with a different key. In line with modern attribute-based access control, policies are specified against identity attributes of users. However our broadcasting approach is privacy-preserving in that users are granted access to a specific document, or subdocument, according to the policies without the need of providing in clear information about their identity attributes to the document publisher. Under our approach, not only does the document publisher not learn the values of the identity attributes of users, but it also does not learn which policy conditions are verified by which users, thus inferences about the values of identity attributes are prevented. Moreover, our key management scheme on which the proposed broadcasting approach is based is efficient in that it does not require to send the decryption keys to the users along with the encrypted document. Users are able to reconstruct the keys to decrypt the authorized portions of a document based on subscription information they have received from the document publisher. The scheme also efficiently handles new subscription of users and revocation of subscriptions.
Policy%2DDriven Service Composition with Information Flow Control.

Efficient and privacy%2Dpreserving enforcement of attribute%2Dbased access control.

Biometrics%2Dbased identifiers for digital identity management.
We present algorithms to reliably generate biometric identifiers from a user’s biometric image which in turn is used for identity verification possibly in conjunction with cryptographic keys. The biometric identifier generation algorithms employ image hashing functions using singular value decomposition and support vector classification techniques. Our algorithms capture generic biometric features that ensure unique and repeatable biometric identifiers. We provide an empirical evaluation of our techniques using 2569 images of 488 different individuals for three types of biometric images; namely fingerprint, iris and face. Based on the biometric type and the classification models, as a result of the empirical evaluation we can generate biometric identifiers ranging from 64 bits up to 214 bits. We provide an example use of the biometric identifiers in privacy preserving multi-factor identity verification based on zero knowledge proofs. Therefore several identity verification factors, including various traditional identity attributes, can be used in conjunction with one or more biometrics of the individual to provide strong identity verification. We also ensure security and privacy of the biometric data. More specifically, we analyze several attack scenarios. We assure privacy of the biometric using the one-way hashing property, in that no information about the original biometric image is revealed from the biometric identifier. 1.
Privacy%2DAware Location%2DAided Routing in Mobile Ad Hoc Networks.

Privilege States Based Access Control for Fine%2DGrained Intrusion Response.

A secure multiparty computation privacy preserving OLAP framework over distributed XML data.

Enforcing spatial constraints for mobile RBAC systems.

Mask a system for privacy%2Dpreserving policy%2Dbased access to published content.

PEAR a hardware based protocol authentication system.

Assuring Data Trustworthiness %2D Concepts and Research Challenges.

Trustworthy Information Concepts and Mechanisms.

Privacy%2Daware role%2Dbased access control.
Abstract. Privacy is considered critical for all organizations needing to manage individual related information. As such, there is an increasing need for access control models which can adequately support the specification and enforcement of privacy policies. In this paper, we propose a model, referred to as Conditional Privacy-aware Role Based Access Control (P-RBAC), which supports expressive condition languages and flexible relations among permission assignments for more complex privacy policies. Efficient algorithms for detecting conflicts, redundancies, and indeterminism for a set of permission assignments are presented. In the paper we also extend Conditional P-RBAC to Universal P-RBAC by taking into account hierarchical relations among roles, data and purposes. In comparison with other approaches, such as P3P, EPAL, and XACML, our work has achieved both expressiveness and efficiency. 1
Guest Editors%27 Introduction Data Quality in the Internet Era.

Group%2DBased Negotiations in P2P Systems.

EXAM a comprehensive environment for the analysis of access control policies.
Policy integration and inter-operation is often a crucial requirement when parties with different access control policies need to participate in collaborative applications and coalitions. Such requirement is even more difficult to address for dynamic large-scale collaborations, in which the number of access control policies to analyze and compare can be quite large. An important step in policy integration and inter-operation is to analyze the similarity of policies. Policy similarity can sometimes also be a pre-condition for establishing a collaboration, in that a party may enter a collaboration with another party only if the policies enforced by the other party match or are very close to its own policies. Existing approaches to the problem of analyzing and comparing access control policies are very limited, in that they only deal with some special cases. By recognizing that a suitable approach to the policy analysis and comparison requires combining different approaches, we propose in this paper a comprehensive environment – EXAM. The environment supports various types of analysis query, that we categorize in the paper. A key component of such environment, on which we focus in the paper, is the policy analyzer able to perform several types of analysis. Specifically, our policy analyzer combines the advantages of existing MTBDD-based and SAT-solver-based techniques. Our experimental results, also reported in the paper, demonstrate the efficiency of our analyzer.
The PROBE Framework for the Personalized Cloaking of Private Locations.

A General Framework for Web Content Filtering.
Web content filtering is a means to make an end user aware of the ‘quality ’ of Web resources by evaluating their content and/or characteristics against his/her preferences. Although it can be used for a variety of purposes, currently it is mainly enforced by a number of Web applications as a service for parental control purposes, and for regulating the access to Web content of users connected to the networks of enterprises, libraries, schools, etc. This is obtained by integrating and optimizing established techniques in the fields of, e.g., data mining and firewall blocking, in order to provide a service addressing the needs of very specific user categories. Yet, what is lacking is a unified filtering framework for all the possible application domains, making it possible to enforce interoperability among the different filtering approaches and the systems based on them. In this paper, a multi-strategy approach is described, which integrates the available techniques and focuses on the use of metadata for rating and
Proceedings of the 5th Workshop on Digital Identity Management

Proceedings of the 33rd Annual IEEE International Computer Software and Applications Conference



Trust Management III
An agent-bas ed model of interpersonal trust is used to develop information sharing security protocols in the spirit of soft security. We demonstrate that availability information can be balanced against security breaches. Our protocols are simple, malleable, and scalable.
Location%2DAware Authentication and Access Control.

D%2Dalgebra for composing access control policy decisions.

Aggregating uncertain access risk estimations from different sources invited paper.

The Challenge of Assuring Data Trustworthiness.

Self%2Dtuning query mesh for adaptive multi%2Droute query processing.
In real-life applications, different subsets of data may have distinct statistical properties, e.g., various websites may have diverse visitation rates, different categories of stocks may have dissimilar price fluctuation patterns. For such applications, it can be fruitful to eliminate the commonly made single execution plan assumption and instead execute a query using several plans, each optimally serving a subset of data with particular statistical properties. Furthermore, in dynamic environments, data properties may change continuously, thus calling for adaptivity. The intriguing question is: can we have an execution strategy that (1) is plan-based to leverage on all the benefits of traditional plan-based systems, (2) supports multiple plans each customized for different subset of data, and yet (3) is as adaptive as “plan-less ” systems like Eddies? While the recently proposed Query Mesh (QM) approach provides a foundation for such an execution paradigm, it does not address the question of adaptivity required for highly dynamic environments. In this work, we fill this gap by proposing a Self-Tuning Query Mesh (ST-QM)  – an adaptive solution for content-based multi-plan execution engines. ST-QM addresses adaptive query processing by abstracting it as a concept drift problem – a wellknown subject in machine learning. Such abstraction allows to discard adaptivity candidates (i.e., the cases indicating a change in the environment) early in the process if they are insignificant or not “worthwhile ” to adapt to, and thus minimize the adaptivity overhead. A unique feature of our approach is that all logical transformations to the execution strategy get translated into a single inexpensive physical operation – the classifier change. Our experimental evaluation using a continuous query engine shows the performance benefits of ST-QM approach over the alternatives, namely the non-adaptive and the Eddies-based solutions.
Preventing velocity%2Dbased linkage attacks in location%2Daware applications.

Assessing the trustworthiness of location data based on provenance.

The Design and Evaluation of Accountable Grid Computing System.

Using Anonymized Data for Classification.

Multi%2Dgranular Spatio%2Dtemporal Object Models Concepts and Research Directions.

A Comprehensive Approach for Solving Policy Heterogeneity.

Multi%2Dgranular Spatio%2Dtemporal Object Models Concepts and Research Directions.

Privacy Preserving OLAP over Distributed XML Documents.

The SCIFC Model for Information Flow Control in Web Service Composition.

Identity Attribute%2DBased Role Provisioning for Human WS%2DBPEL Processes.

Privacy%2Dpreserving management of transactions%27 receipts for mobile environments.
Users increasingly use their mobile devices for electronic transactions to store related information, such as digital receipts. However, such information can be target of several attacks. There are some security issues related to M-commerce: the loss or theft of mobile devices results in a exposure of transaction information; transaction receipts that are send over WI-FI or 3G networks can be easily intercepted; transaction receipts can also be captured via Bluetooth connections without the user’s consent; and mobile viruses, worms and Trojan horses can access the transaction information stored on mobile devices if this information is not protected by passwords or PIN numbers. Therefore, assuring privacy and security of transactions ’ information, as well as of any sensitive information stored on mobile devices is crucial. In this paper, we propose a privacy-preserving approach to manage electronic transaction receipts on mobile devices. The approach is based on the notion of transaction receipts issued by service providers upon a successful transaction and combines Pedersen commitment and Zero Knowledge Proof of Knowledge (ZKPK) techniques and Oblivious Commitment-Based Envelope (OCBE) protocols. We have developed a version of such protocol for Near Field Communication (NFC) enabled cellular phones. 1.
TIUPAM A Framework for Trustworthiness%2DCentric Information Sharing.

Elimination of Subjectivity from Trust Recommendation.
In many collaborative applications, a party who wishes to make a transaction requires that it has a certain level of trust in the other party. It is frequently the case that the parties are unknown to each other and thus share no pre-existing trust. Trust-based systems enable users to establish trust in unknown users through trust recommendation from known users. For example, Bob may choose to trust an unknown user Carol when he receives a recommendation from his friend Alice that Carol&#039;s trustworthiness is 0.8 on the interval [0,1].

In this paper we highlight the problem that when a trust value is recommended by one user to another it may lose its real meaning due to subjectivity. Bob may regard 0.8 as a very high value of trust but it is possible that Alice perceived this same value as only average. We present a statistical solution for the elimination of subjectivity from trust recommendation. We run experiments to compare our subjectivity-eliminated trust recommendation method with the unmodified method. In a random graph based web of trust with high subjectivity, it is observed that the novel method can give better results up to 95% of the time.

Assured Information Sharing Life Cycle.

A Characterization of the problem of secure provenance management.

Interactive Location Cloaking with the PROBE Obfuscator.
(ACM) Special Interest Group on Spatial Information (SIGSPATIAL). ACM SIGSPATIAL addresses issues related to the acquisition, management, and processing of spatially-related information with a focus on algorithmic, geometric, and visual considerations. The scope includes, but is not limited to, geographic information systems. Current ACM SIGSPATIAL officers are:
VeryIDX %2D A Privacy Preserving Digital Identity Management System for Mobile Devices.

Visualization for Access Control Policy Analysis Results Using Multi%2Dlevel Grids.

Access control policy combining theory meets practice.

Access control policy combining theory meets practice.

Supporting RBAC with XACML OWL.

An algebra for fine%2Dgrained integration of XACML policies.
Collaborative and distributed applications, such as dynamic coalitions and virtualized grid computing, often require integrating access control policies of collaborating parties. Such an integration must be able to support complex authorization specifications and the fine-grained integration requirements that the various parties may have. In this paper, we introduce an algebra for fine-grained integration of sophisticated policies. The algebra is able to support the specification of a large variety of integration constraints. To assess the expressive power of our algebra, we prove its completeness and minimality. We then propose a framework that uses the algebra for the fine-grained integration of policies expressed in XACML. We also present a methodology for generating the actual integrated XACML policy, based on the notion of Multi-Terminal Binary Decision Diagrams.  
Automating role%2Dbased provisioning by learning from examples.

Adaptive Management of Multigranular Spatio%2DTemporal Object Attributes.
Abstract. In applications involving spatio-temporal modelling, granularities of data may have to adapt according to the evolving semantics and significance of data. To address such a problem, in this paper we define ST 2 ODMGe, a multigranular spatio-temporal model supporting evolutions, which encompass the dynamic adaptation of attribute granularities, and the deletion of attribute values. Evolutions are specified as Event- Condition- Action rules and are performed at run-time. The event, the condition and the action may refer to a period of time and a geographical area. Periodic evolutions may be specified, referring to both transaction and valid time dimensions. The evolution may also be constrained by the attribute values. Evolutions greatly enhance flexibility in multigranular spatio-temporal data handling but require revisiting the notion of object consistency with respect to class definitions and access to multigranular object values. 1
StreamShield a stream%2Dcentric approach towards security and privacy in data stream environments.

Assured information sharing concepts and issues.

Adaptive Management of Multigranular Spatio%2DTemporal Object Attributes.
Abstract. In applications involving spatio-temporal modelling, granularities of data may have to adapt according to the evolving semantics and significance of data. To address such a problem, in this paper we define ST 2 ODMGe, a multigranular spatio-temporal model supporting evolutions, which encompass the dynamic adaptation of attribute granularities, and the deletion of attribute values. Evolutions are specified as Event- Condition- Action rules and are performed at run-time. The event, the condition and the action may refer to a period of time and a geographical area. Periodic evolutions may be specified, referring to both transaction and valid time dimensions. The evolution may also be constrained by the attribute values. Evolutions greatly enhance flexibility in multigranular spatio-temporal data handling but require revisiting the notion of object consistency with respect to class definitions and access to multigranular object values. 1
A Hybrid Technique for Private Location%2DBased Queries with Database Protection.

Physically restricted authentication with trusted hardware.
Modern computer systems permit mobile users to access protected information from remote locations. In certain secure environments, it would be desirable to restrict this access to a particular computer or set of computers. Existing solutions of machine-level authentication are undesirable for two reasons. First, they do not allow fine-grained application layer access decisions. Second, they are vulnerable to insider attacks in which a trusted administrator acts maliciously. In this work, we describe a novel approach using secure hardware that solves these problems. In our design, multiple administrators are required for installation of a system. After installation, the authentication privileges are physically linked to that machine, and no administrator can bypass these controls. We define an administrative model and detail the requirements for an authentication protocol to be compatible with our methodology. Our design presents some challenges for large-scale systems, in addition to the benefit of reduced maintenance. 1
Query Processing Techniques for Compliance with Data Confidence Policies.

An Access Control Language for a General Provenance Model.

L%27Elimination de la subjectivit%E9 dans la recommandation de confiance.


An Interoperable Approach to Multifactor Identity Verification.

Privacy%2Dpreserving Digital Identity Management for Cloud Computing.

Privacy%2DAware Role%2DBased Access Control.
Abstract. Privacy is considered critical for all organizations needing to manage individual related information. As such, there is an increasing need for access control models which can adequately support the specification and enforcement of privacy policies. In this paper, we propose a model, referred to as Conditional Privacy-aware Role Based Access Control (P-RBAC), which supports expressive condition languages and flexible relations among permission assignments for more complex privacy policies. Efficient algorithms for detecting conflicts, redundancies, and indeterminism for a set of permission assignments are presented. In the paper we also extend Conditional P-RBAC to Universal P-RBAC by taking into account hierarchical relations among roles, data and purposes. In comparison with other approaches, such as P3P, EPAL, and XACML, our work has achieved both expressiveness and efficiency. 1

Security Analysis of the SASI Protocol.

Specification and enforcement of flexible security policy for active cooperation.

A comprehensive simulation tool for the analysis of password policies.

Security for Web Services Standards and Research Issues.
Abstract. This chapter identifies the main security requirements for Web services and it describes how such security requirements are addressed by standards for Web services security recently developed or under development by various standardizations bodies. Standards are reviewed according to a conceptual framework that groups them by the main functionalities they provide. Standards that are covered include most of the standards encompassed by the WSS roadmap [2]; the Security Assertion Markup Language-SAML-, WS-Policy, XACML, that is related to access control and has been recently extended with a profile for Web services access control; XKMS and WS-Trust; WS-Federation, LibertyAlliance and Shibboleth, that address the important problem of identity management in federated organizations. Finally, issues related to the use of the standards are discussed and open research issues in the area of access control for Web services and innovative digital identity management techniques are outlined. 1
An Overview of VeryIDX %2D A Privacy%2DPreserving Digital Identity Management System for Mobile Devices.

Privacy%2Dpreserving incremental data dissemination.
Although the k-anonymity and ℓ-diversity models have led to a number of valuable privacy-protecting techniques and algorithms, the existing solutions are currently limited to static data release. That is, it is assumed that a complete dataset is available at the time of data release. This assumption implies a significant shortcoming, as in many applications data collection is rather a continual process. Moreover, the assumption entails “one-time ” data dissemination; thus, it does not adequately address today’s strong demand for immediate and up-to-date information. In this paper, we consider incremental data dissemination, where a dataset is continuously incremented with new data. The key issue here is that the same data may be anonymized and published multiple times, each of the time in a different form. Thus, static anonymization (i.e., anonymization which does not consider previously released data) may enable various types of inference. In this paper, we identify such inference issues and discuss some prevention methods. 1.

Tagging Stream Data for Rich Real%2DTime Services.
In recent years, data streams have become ubiquitous as technology is improving and the prices of portable devices are falling, e.g., sensor networks, location-based services. Most data streams transmit only data tuples based on which continuous queries are evaluated. In this paper, we propose to enrich data streams with a new type of metadata called streaming tags or short tick-tags 1. The fundamental premise of tagging is that users can label data using uncontrolled vocabulary, and these tags can be exploited in a wide variety of applications, such as data exploration, data search, and to produce “enriched ” with additional semantics, thus more informative query results. In this paper we focus primarily on the problem of continuous query processing with streaming tags and tagged objects, and address the tick-tag semantic issues as well as efficiency concerns. Our main contributions are as follows. First, we specify a general and flexible Stream Tag Framework (or short STF) that supports a stream-centric approach to tagging, and where tick-tags, attached to streaming objects are treated as first-class citizens. Second, under STF, users can query tags explicitly as well as implicitly by outputting the tags of the base data together with query results. Finally, we have implemented STF in a prototype Data Stream Management System, and through a set of performance experiments, we show that the cost of stream tagging is small and the approach is scalable to a large percentage of tagged objects.
Query Mesh Multi%2DRoute Query Processing Technology.
We propose to demonstrate a practical alternative approach to the current state-of-the-art query processing techniques, called the “Query Mesh ” (or QM, for short). The main idea of QM is to compute multiple routes (i.e., query plans) 1, each designed for a particular subset of data with distinct statistical properties. Based on the execution routes and the data characteristics, a classifier model is induced and is used to partition new data tuples to assign the best routes for their processing. We propose to demonstrate the QM framework in the streaming context using our demo application, called the “Ubi-City”. We will illustrate the innovative features of QM, including: the QM optimization with the integrated machine learning component, the QM execution using the efficient “Self-Routing Fabric ” infrastructure, and finally, the QM adaptive component that performs the online adaptation of QM with near-zero runtime overhead. 1.

Privacy%2Dpreserving techniques for location%2Dbased services.
(ACM) Special Interest Group on Spatial Information (SIGSPATIAL). ACM SIGSPATIAL addresses issues related to the acquisition, management, and processing of spatially-related information with a focus on algorithmic, geometric, and visual considerations. The scope includes, but is not limited to, geographic information systems. Current ACM SIGSPATIAL officers are:
Efficient integration of fine%2Dgrained access control and resource brokering in grid.

Location Privacy in Moving%2DObject Environments.

Foreword for the special issue of selected papers from the 1st ACM SIGSPATIAL Workshop on Security and Privacy in GIS and LBS.

Location Privacy in Moving%2DObject Environments.

Beyond k%2DAnonymity A Decision Theoretic Framework for Assessing Privacy Risk.
An important issue any organization or individual has to face when managing data containing sensitive information, is the risk that can be incurred when releasing such data. Even though data may be sanitized before being released, it is still possible for an adversary to reconstruct the original data using additional information thus resulting in privacy violations. To date, however, a systematic approach to quantify such risks is not available. In this paper we develop a framework, based on statistical decision theory, that assesses the relationship between the disclosed data and the resulting privacy risk. We model the problem of deciding which data to disclose, in terms of deciding which disclosure rule to apply to a database. We assess the privacy risk by taking into account both the entity identification and the sensitivity of the disclosed information. Furthermore, we prove that, under some conditions, the estimated privacy risk is an upper bound on the true privacy risk. Finally, we relate our framework with the k-anonymity disclosure method. The proposed framework makes the assumptions behind k-anonymity explicit, quantifies them, and extends them in several natural directions. I.
Proceedings of the 4th Workshop on Digital Identity Management

Proceedings of the SIGSPATIAL ACM GIS 2008 International Workshop on Security and Privacy in GIS and LBS

Progress in WWW Research and Development

A Policy%2DBased Accountability Tool for Grid Computing Systems.

Hierarchical Domains for Decentralized Administration of Spatially%2DAware RBAC Systems.

High%2DAssurance Integrity Techniques for Databases.

Verification of Receipts from M%2Dcommerce Transactions on NFC Cellular Phones.
Abstract—A main challenge in mobile commerce is to make it possible for users to manage their transaction histories from both online e-commerce transactions and in-person transactions. Such histories are typically useful to build credit or to establish trust based on past transactions. In this paper we propose an approach to manage electronic receipts on cellular devices by assuring their secure and privacy-preserving usage. We provide a comprehensive notion of transactions history including both on-line transaction and in-person transactions. We apply cryptographic protocols, such as secret sharing and zero knowledge proofs, in a potentially vulnerable and constrained setting. Specifically, our approach supports flexible strategies based on Shamir’s secret sharing to cater to different user requirements and architectural constraints. In addition, aggregate zero knowledge proofs are used to efficiently support proofs of various receipt attributes. We have implemented the system on Nokia NFC cellular phones and report in the paper performance evaluation results. I.
A Federated Digital Identity Management Approach for Business Processes.

Querying Multigranular Spatio%2Dtemporal Objects.

Minimal credential disclosure in trust negotiations.
The secure release of identity attributes is a key enabler for electronic business interactions. In particular, integrity and confidentiality of identity attributes are two key requirements in such context. Users should also have the maximum control possible over the release of their identity attributes and should state under which conditions these attributes can be disclosed. Moreover, users should disclose only the identity attributes that are actually required for the transactions at hand. In this paper we present an approach for the controlled release of identity attributes that addresses such requirements. The approach is based on the integration of trust negotiation and minimal credential disclosure techniques. Trust negotiations support selective and incremental disclosure of identity attributes, while minimal credential disclosure guarantees that only the attributes necessary to complete the on line interactions are disclosed. 1
Identity%2Dbased long running negotiations.

Multigranular spatio%2Dtemporal models implementation challenges.

Protecting Databases from Query Flood Attacks.

Secure Delta%2DPublishing of XML Content.

Privately Updating Suppression and Generalization based k%2DAnonymous Databases.

A Security Punctuation Framework for Enforcing Access Control on Streaming Data.
Abstract — The management of privacy and security in the context of data stream management systems (DSMS) remains largely an unaddressed problem to date. Unlike in traditional DBMSs where access control policies are persistently stored on the server and tend to remain stable, in streaming applications the contexts and with them the access control policies on the real-time data may rapidly change. A person entering a casino may want to immediately block others from knowing his current whereabouts. We thus propose a novel “stream-centric ” approach, where security restrictions are not persistently stored on the DSMS server, but rather streamed together with the data. Here, the access control policies are expressed via security constraints (called security punctuations,orshort,sps) and are embedded into data streams. The advantages of the sp model include flexibility, dynamicity and speed of enforcement. DSMSs can adapt to not only data-related but also security-related selectivities, which helps reduce the waste of resources, when few subjects have access to data. We propose a security-aware query algebra and new equivalence rules together with cost estimations to guide the security-aware query plan optimization. We have implemented the sp framework in a real DSMS. Our experimental results show the validity and the performance advantages of our sp model as compared to alternative access control enforcement solutions for DSMSs.
A Hybrid Approach to Private Record Linkage.

Continuous Intersection Joins Over Moving Objects.
Abstract — The continuous intersection join query is computationally expensive yet important for various applications on moving objects. No previous study has specifically addressed this query type. We can adopt a naive algorithm or extend an existing technique (TP-Join) to process the query. However, they compute the answer for either too long or too short a time interval, which results in either a very large computation cost per object update or too frequent answer updates, respectively. This motivates us to optimize the query processing in the time dimension. In this study, we achieve this optimization by introducing the new concept of time-constrained (TC) processing. Further, TC processing enables a set of effective improvement techniques on traditional intersection join algorithms. With a thorough experimental study, we show that our algorithm outperforms the best adapted existing solution by several orders of magnitude. I.
Trust establishment in the formation of Virtual Organizations.

Authorization and User Failure Resiliency for WS%2DBPEL Business Processes.

A Practical and Flexible Key Management Mechanism For Trusted Collaborative Computing.

P%2DCDN Extending access control capabilities of P2P systems to provide CDN services.

Cryptanalysis of the LCSS RFID Authentication Protocol.

Privacy%2DPreserving Accountable Accuracy Management Systems %28PAAMS%29.
Abstract. We argue for the design of “Privacy-preserving Accountable Accuracy Management Systems (PAAMS)”. The designs of such systems recognize from the onset that accuracy, accountability, and privacy management are intertwined. As such, these systems have to dynamically manage the tradeoffs between these (often conflicting) objectives. For example, accuracy in such systems can be improved by providing better accountability links between structured and unstructured information. Further, accuracy may be enhanced if access to private information is allowed in controllable and accountable ways. Our proposed approach involves three key elements. First, a model to link unstructured information such as that found in email, image and document repositories with structured information such as that in traditional databases. Second, a model for accuracy management and entity disambiguation by proactively preventing, detecting and tracing errors in information bases. Third, a model to provide privacy-governed operation as accountability and accuracy are managed.
EXAM An Environment for Access Control Policy Analysis and Management.

Automatic Compliance of Privacy Policies in Federated Digital Identity Management.

Proactive Role Discovery in Mediator%2DFree Environments.

Database Intrusion Detection and Response.

Policy decomposition for collaborative access control.

An obligation model bridging access control policies and privacy policies.

Mining roles with semantic meanings.
With the growing adoption of role-based access control (RBAC) in commercial security and identity management products, how to facilitate the process of migrating a non-RBAC system to an RBAC system has become a problem with significant business impact. Researchers have proposed to use data mining techniques to discover roles to complement the costly top-down approaches for RBAC system construction. A key problem that has not been adequately addressed by existing role mining approaches is how to discover roles with semantic meanings. In this paper, we study the problem in two settings with different information availability. When the only information is user-permission relation, we propose to discover roles whose semantic meaning is based on formal concept lattices. We argue that the theory of formal concept analysis provides a solid theoretical foundation for mining roles from userpermission relation. When user-attribute information is also available, we propose to create roles that can be explained by expressions of user-attributes. Since an expression of attributes describes a real-world concept, the corresponding role represents a real-world concept as well. Furthermore, the algorithms we proposed balance the semantic guarantee of roles with system complexity. Our experimental results demonstrate the effectiveness of our approaches.

Privacy%2DPreserving Techniques for Location%2DBased Services.
(ACM) Special Interest Group on Spatial Information (SIGSPATIAL). ACM SIGSPATIAL addresses issues related to the acquisition, management, and processing of spatially-related information with a focus on algorithmic, geometric, and visual considerations. The scope includes, but is not limited to, geographic information systems. Current ACM SIGSPATIAL officers are:

Security and privacy for geospatial data concepts and research directions.

Position transformation a location privacy protection method for moving objects.

ARUBA A Risk%2DUtility%2DBased Algorithm for Data Disclosure.
Dealing with sensitive data has been the focus of much of recent research. On one hand data disclosure may incur some risk due to security breaches, but on the other hand data sharing has many advantages. For example, revealing customer transactions at a grocery store may be beneficial when studying purchasing patterns and market demand. However, a potential misuse of the revealed information may be harmful due to privacy violations. In this paper we study the tradeoff between data disclosure and data retention. Specifically, we address the problem of minimizing the risk of data disclosure while maintaining its utility above a certain acceptable threshold. We formulate the problem as a discrete optimization problem and leverage the special monotonicity characteristics for both risk and utility to construct an efficient algorithm to solve it. Such an algorithm determines the optimal transformations that need to be performed on the microdata before it gets released. These optimal transformations take into account both the risk associated with data disclosure and the benefit of it (referred to as utility). Through extensive experimental studies we compare the performance of our proposed algorithm with other date disclosure algorithms in the literature in terms of risk, utility, and time. We show that our proposed framework outperforms other techniques for sensitive data disclosure.
Context%2DAware Adaptation of Access%2DControl Policies.
Today, most public service delivery mechanisms, such as hospitals, police and fire departments, rely exclusively on digital generation, storage and analysis of vital information. To protect critical digital resources access control mechanisms are employed. The aim is to define rules under which authorized users can access resources required to perform organizational tasks. These rules or policies define constraints of time and space on digital resources. Natural or man-made disasters pose a unique challenge, whereby, previously defined constraints may debilitate the ability of the organization to act to its fullest capability. In this paper we propose to employ contextual parameters; specifically, activity context in the form of emergency warnings, to adapt access control policies according to a priori configuration which allows maximum access to critical resources. We also propose an architecture for the detection of crises in the form of activity context and incorporate it in the policy adaptation framework. I.
Responding to Anomalous Database Requests.

An Approach to Evaluate Data Trustworthiness Based on Data Provenance.

Object%2DOriented Databases.
We present a novel language for querying object-oriented databases. The language is built around the idea of extended path expressions that substantially generalize [ZAN83], and on an adaptation of the first-order formalization of object-oriented languages from [KW89, KLW90, KW92]. The language incorporates features not found in earlier proposals; it is easier to use and has greater expressive power. Some of the salient features of our language are: ffl Precise model-theoretic semantics. ffl A very expressive form of path expressions that not only can do joins, selections and unnesting, but can also be used to explore the database schema. ffl Views can be defined and manipulated in a much more uniform way than in other proposals. ffl Database schema can be explored in the very same language that is used to retrieve data. Unlike in relational languages, the user needs not know anything about the system tables that store schema information. ffl The notions of a type and type-correctness have precise meaning. It accommodates a wide variety of queries that might be deemed well- or ill-typed under different circumstances. In particular, we show that there is more than one way of settling the issue of type correctness. For expository purposes and due to space limitation, we chose to make a number of simplifying assumptions and left some features out. A more complete account can be found in [KSK92].
Formal foundations for hybrid hierarchies in GTRBAC.
A role hierarchy defines semantics related to permission acquisitions and role activations through role-role relationships. It can be utilized for efficiently and effectively structuring functional roles of an organization having related access control needs. Temporal constraints on role enablings and role activations can have various implications on such a role hierarchy. The focus of this paper is the analysis of hybrid role hierarchies in the context of the Generalized Temporal Role Based Access Control (GTRBAC) model that allows specification of a comprehensive set of temporal constraints on role, user-role assignments and role-permission assignments. We introduce the notion of uniquely activable set (UAS) associated with a role hierarchy that indicates the access capabilities of a user resulting from his membership to a role in the hierarchy. Identifying such a role set is essential while making an authorization decision about whether or not a user should be allowed to activate a particular combination of roles in a single session. Furthermore, when separation-of-duty (SoD) constraints are present in the system, it is also essential to ensure that there are no role combinations that can be allowed to be activated in a single user session. In other words, knowledge about UAS can be used to facilitate enforcement of the principle of least privilege. Because of the separation of permission inheritance and role activation semantics in
XACML Policy Integration Algorithms.
XACML is the OASIS standard language for the specification of authorization and entitlement policies. However, while XACML fits well security requirements of a single enterprise (even if large and composed by multiple departments), it does not address the requirements of virtual enterprises built with collaboration of several autonomous subjects sharing their resources to provide better services to customers. In the paper we highlight such limitation and we propose an XACML extension, the policy integration algorithm, to address them. In the paper we also describe how the process of comparing two XACML policies is different from the process used to compare other business rules.
Context%2DAware Adaptation of Access%2DControl Policies.
Today, most public service delivery mechanisms, such as hospitals, police and fire departments, rely exclusively on digital generation, storage and analysis of vital information. To protect critical digital resources access control mechanisms are employed. The aim is to define rules under which authorized users can access resources required to perform organizational tasks. These rules or policies define constraints of time and space on digital resources. Natural or man-made disasters pose a unique challenge, whereby, previously defined constraints may debilitate the ability of the organization to act to its fullest capability. In this paper we propose to employ contextual parameters; specifically, activity context in the form of emergency warnings, to adapt access control policies according to a priori configuration which allows maximum access to critical resources. We also propose an architecture for the detection of crises in the form of activity context and incorporate it in the policy adaptation framework. I.
Policy Mapper Administering Location%2DBased Access%2DControl Policies.

An Efficient Time%2DBound Hierarchical Key Management Scheme for Secure Broadcasting.
Abstract — In electronic subscription and pay TV systems, data can be organized and encrypted using symmetric key algorithms according to predefined time periods and user privileges, then broadcast to users. This requires an efficient way to manage the encryption keys. In this scenario, time-bound key management schemes for a hierarchy were proposed by Tzeng and Chien in 2002 and 2005, respectively. Both schemes are insecure against collusion attacks. In this paper, we propose a new key assignment scheme for access control which is both efficient and secure. Elliptic curve cryptography is deployed in this scheme. We also provide analysis of the scheme with respect to security and efficiency issues. Index Terms — Secure broadcasting, time-bound hierarchical key management, elliptic curves, elliptic curve discrete logarithm problem(ECDLP). I.
Watermarking Relational Databases Using Optimization%2DBased Techniques.
Proving ownership rights on outsourced relational databases is a crucial issue in today internet-based application environments and in many content distribution applications. In this paper, we present a mechanism for proof of ownership based on the secure embedding of a robust imperceptible watermark in relational data. We formulate the watermarking of relational databases as a constrained optimization problem, and discuss efficient techniques to solve the optimization problem and to handle the constraints. Our watermarking technique is resilient to watermark synchronization errors because it uses a partitioning approach that does not require marker tuples. Our approach overcomes a major weakness in previously proposed watermarking techniques. Watermark decoding is based on a threshold-based technique characterized by an optimal threshold that minimizes the probability of decoding errors. We implemented a proof of concept implementation of our watermarking technique and showed by experimental results that our technique is resilient to tuple deletion, alteration and insertion attacks. Keywords: Watermarking, Digital Rights, Optimization. 1 1
Anonymous Geo%2DForwarding in MANETs through Location Cloaking.

Secure Collaboration in a Mediator%2DFree Distributed Environment.

Efficient and Secure Content Processing and Distribution by Cooperative Intermediaries.

A New Model for Secure Dissemination of XML Content.

An Access%2DControl Framework for WS%2DBPEL.

Measuring the structural similarity among XML documents and DTDs.
Sources of XML documents are proliferating on the Web and documents are more and more frequently exchanged among sources. At the same time, there is an increasing need of exploiting database tools to manage this kind of data. An important novelty of XML is that information on document structures is available on the Web together with the document contents. This information can be used to improve document handling and to achieve more effective and efficient searches on documents. However, in such an heterogeneous environment as the Web, it is not reasonable to assume that XML documents that enter a source always conform to a predefined DTD present in the source.
Spatial Domains for the Administration of Location%2Dbased Access Control Policies.

Cryptanalysis of Some RFID Authentication Protocols.

Structural signatures for tree data structures.
Data sharing with multiple parties over a third-party distribution framework requires that both data integrity and confidentiality be assured. One of the most widely used data organization structures is the tree structure. When such structures encode sensitive information (such as in XML documents), it is crucial that integrity and confidentiality be assured not only for the content, but also for the structure. Digital signature schemes are commonly used to authenticate the integrity of the data. The most widely used such technique for tree structures is the Merkle hash technique, which however is known to be “not hiding”, thus leading to unauthorized leakage of information. Most techniques in the literature are based on the Merkle hash technique and thus suffer from the problem of unauthorized information leakages. Assurance of integrity and confidentiality (no leakages) of tree-structured data is an important problem in the context of secure data publishing and content distribution systems. In this paper, we propose a signature scheme for tree structures, which assures both confidentiality and integrity and is also efficient, especially in third-party distribution environments. Our integrity assurance technique, which we refer to as the “Structural signature scheme”, is based on the structure of the tree as defined by tree traversals (pre-order, post-order, in-order) and is defined using a randomized notion of such traversal numbers. In addition to formally defining the technique, we prove that it protects against violations of content and structural integrity and information leakages. We also show through complexity and performance analysis that the structural signature scheme is efficient; with respect to the Merkle hash technique, it incurs comparable cost for signing the trees and incurs lower cost for user-side integrity verification.  
Detecting anomalous access patterns in relational databases.
Abstract A considerable effort has been recently devoted
A structure preserving approach for securing XML documents.

Efficient k %2DAnonymization Using Clustering Techniques.
Abstract. k-anonymization techniques have been the focus of intense research in the last few years. An important requirement for such techniques is to ensure anonymization of data while at the same time minimizing the information loss resulting from data modifications. In this paper we propose an approach that uses the idea of clustering to minimize information loss and thus ensure good data quality. The key observation here is that data records that are naturally similar to each other should be part of the same equivalence class. We thus formulate a specific clustering problem, referred to as k-member clustering problem. We prove that this problem is NP-hard and present a greedy heuristic, the complexity of which is in O(n 2). As part of our approach we develop a suitable metric to estimate the information loss introduced by generalizations, which works for both numeric and categorical data. 1
Data Management in RFID Applications.

Password policy simulation and analysis.


Receipt management%2D transaction history based trust establishment.
In a history-based trust-management system, users and service providers use information about past transactions to make trust-based decisions concerning current transactions. One category of such systems is represented by the reputation systems. However, despite the growing body of experience in building reputation systems, there are several limitations on how they are typically implemented. They often rely on scores that are evaluated by service providers and are often not reliable or well understood. We believe that reputation has to be based on objective and reliable information. In such context, transaction histories play an important role. In this paper, we present the VeryIDX system that implements an electronic receipt infrastructure and supports protocols to build and manage online transaction history of users. The receipt protocols are shown to have several essential security and privacy properties. We present a basic yet reasonably expressive language which provides service providers with a new way to establish trust based on users ’ transaction history. We also describe the architecture and prototype implementation of VeryIDX, based on several important design considerations of a real-world e-commerce system infrastructure. 1.

Privacy Requirements in Identity Management Solutions.

Supporting Robust and Secure Interactions in Open Domains through Recovery of Trust Negotiations.
Trust negotiation supports authentication and access control across multiple security domains by allowing parties to use non-forgeable digital credentials to establish trust. By their nature trust negotiation systems are used in environments that are not always reliable. In particular, it is important not only to protect negotiations against malicious attacks, but also against failures and crashes of the parties or of the communication means. To address the problem of failures and crashes, we propose an efficient and secure recovery mechanism. The mechanism includes two recovery protocols, one for each of the two main negotiation phases. In fact, because of the requirements that both services and credentials have to be protected on the basis of the associated disclosure policies, most approaches distinguish between a phase of disclosure policy evaluation from a phase devoted to actual credentials exchange. We prove that the protocols, besides being efficient, are secure with respect to integrity, and confidentiality and are idempotent. To the best of our knowledge, this is the first effort for achieving robustness and fault tolerance of trust negotiation systems. 1
Auth%2DSL %2D A System for the Specification and Enforcement of Quality%2DBased Authentication Policies.

A Policy%2DBased Authorization Framework for Web Services Integrating XGTRBAC and WS%2DPolicy.

User Tasks and Access Control overWeb Services.

Profiling Database Application to Detect SQL Injection Attacks.

Managing Risks in RBAC Employed Distributed Environments.

XACML Function Annotations.
XACML is being increasingly adopted in large enterprise systems for specifying access control policies. However, the efficient analysis and integration of multiple policies in such large distributed systems still remains a difficult task. In this paper, we propose an annotation technique which is a simple extension to XACML, and may greatly benefit the policy analysis process. We also discuss an important consistency problem during XACML policy translation and point out a few possible research directions.
Decentralized authorization and data security in web content delivery.
The fast development of web services, or more broadly, service-oriented architectures (SOAs), has prompted more organizations to move contents and applications out to the Web. Softwares on the web allow one to enjoy a variety of services, for example translating texts into other languages and converting a document from one format to another. In this paper, we address the problem of maintaining data integrity and confidentiality in web content delivery when dynamic content modifications are needed. We propose a flexible and scalable model for secure content delivery based on the use of roles and role certificates to manage web intermediaries. The proxies coordinate themselves in order to process and deliver contents, and the integrity of the delivered content is enforced using a decentralized strategy. To achieve this, we utilize a distributed role lookup table and a role-number based routing mechanism. We give an efficient secure protocol, iDeliver, for content processing and delivery, and also describe a method for securely updating role lookup tables. Our solution also applies to the security problem in web-based workflows, for example maintaining the data integrity in automated trading, contract authorization, and supply chain management in large organizations.
An approach to evaluate policy similarity.
Recent collaborative applications and enterprises very often need to efficiently integrate their access control policies. An important step in policy integration is to analyze the similarity of policies. Existing approaches to policy similarity analysis are mainly based on logical reasoning and boolean function comparison. Such approaches are computationally expensive and do not scale well for large heterogeneous distributed environments (like Grid computing systems). In this paper, we propose a policy similarity measure as a filter phase for policy similarity analysis. This measure provides a lightweight approach to pre-compile a large amount of policies and only return the most similar policies for further evaluation. In the paper we formally define the measure, by taking into account both the case of categorical attributes and numeric attributes. Detailed algorithms are presented for the similarly computation. Results of our case study demonstrates the efficiency and practical value of our approach.
Privacy%2Daware role based access control.
Abstract. Privacy is considered critical for all organizations needing to manage individual related information. As such, there is an increasing need for access control models which can adequately support the specification and enforcement of privacy policies. In this paper, we propose a model, referred to as Conditional Privacy-aware Role Based Access Control (P-RBAC), which supports expressive condition languages and flexible relations among permission assignments for more complex privacy policies. Efficient algorithms for detecting conflicts, redundancies, and indeterminism for a set of permission assignments are presented. In the paper we also extend Conditional P-RBAC to Universal P-RBAC by taking into account hierarchical relations among roles, data and purposes. In comparison with other approaches, such as P3P, EPAL, and XACML, our work has achieved both expressiveness and efficiency. 1
A privacy preserving assertion based policy language for federation systems.

Privacy preserving schema and data matching.
In many business scenarios record matching is performed across different data sources with the aim of identifying common information shared among these sources. Such need is however often in contrast with privacy requirements concerning the data stored by the sources, like it is the case in e-Health and e-Government applications. In this paper, we propose a protocol for record matching that preserves privacy both at the data level and at the schema level. Specifically, if two sources need to identify their common data, by running the protocol they can compute the matching of their datasets without sharing their data in clear and only sharing the result of the matching. The protocol allows each source to hide the records not to be shared with the other source, the detail of the attributes in its schema, and several other features that the source may want to keep private. The protocol uses a third party, and maps records into a vector space in order to preserve their privacy. So far, the mapping of records into a vector space has been used only to improve the matching efficiency; by contrast we demonstrate that a proper embedding of records can also be used for assuring privacy. Experimental results show the efficiency of the matching protocol in terms of precision and recall as well as the good computational performance. 1.
On the Correctness Criteria of Fine%2DGrained Access Control in Relational Databases.
Databases are increasingly being used to store information covered by heterogeneous policies, which require support for access control with great flexibility. This has led to increasing interest in using fine-grained access control, where different cells in a relation may be governed by different access control rules. Although several proposals have been made to support fine-grained access control, there currently does not exist a formal notion of correctness regarding the query answering procedure. In this paper, we propose such a formal notion of correctness in fine-grained database access control, and discuss why existing approaches fall short in some circumstances. We then propose a labeling approach for masking unauthorized information and a query evaluation algorithm which better supports fine-grained access control. Finally, we implement our algorithm using query modification and evaluate its performance. 1.
Information carrying identity proof trees.
In open distributed systems, the verification of properties of subjects is a crucial task for authorization. Very often access to resources is based on policies that express (possibly complex) requirements in terms of what are referred to variously as identity properties, attributes, or characteristics of the subject. Example characteristics include whether the subject is (operating on behalf of) a user of a certain age or having a certain credit rating, or is an organization having certain accreditation, to name just a few. In a distributed system having no central authority on subject characteristics, evaluation of such policy requirements is a challenging task. In this paper we provide an approach according to which an entity, referred to as verifier, can evaluate a query concerning properties related to the identity of a subject, which may be required for the purpose of authorizing some action. The present contribution concerns the reuse of query results. We consider issues related to temporal validity (i.e., expiration and revocation of identity properties) as well as issues related to confidentiality when one entity reuses query results computed by another entity. We employ constraint logic programming as the foundation of our policy rules and query evaluation. This provides a very general, flexible basis, and enable our work to be applied more or less directly to several existing policy frameworks. The process of evaluation of a query against a subject identity is traced through a structure, referred to as identity proof tree, that carries all information proving that a policy requirement is met. 1
Challenges of Testing Web Services and Security in SOA Implementations.

GEO%2DRBAC A spatially aware RBAC.
Securing access to data in location-based services and mobile applications requires the definition of spatially aware access control systems. Even if some approaches have already been proposed either in the context of geographic database systems or context-aware applications, a comprehensive framework, general and flexible enough to cope with spatial aspects in real mobile applications, is still missing. In this paper, we make one step towards this direction and we present GEO-RBAC, an extension of the RBAC model to deal with spatial and location-based information. In GEO-RBAC, spatial entities are used to model objects, user positions, and geographically bounded roles. Roles are activated based on the position of the user. Besides a physical position, obtained from a given mobile terminal or a cellular phone, users are also assigned a logical and device independent position, representing the feature (the road, the town, the region) in which they are located. To make the model more flexible and re-usable, we also introduce the concept of role schema, specifying the name of the role as well as the type of the role spatial boundary and the granularity of the logical position. We then extend GEO-RBAC to cope with hierarchies, modeling permission, user, and activation inheritance, and separation of duty constraints. The proposed classes of constraints extend traditional ones to deal with different granularities (schema/instance
PP%2Dtrust%2DX A system for privacy preserving trust negotiations.
Trust negotiation is a promising approach for establishing trust in open systems, in which sensitive interactions may often occur between entities with no prior knowledge of each other. Although to date several trust negotiation systems have been proposed, none of them fully address the problem of privacy preservation. Today, privacy is one of the major concerns of users when exchanging information through the Web and thus we believe that trust negotiation systems must effectively address privacy issues in order to be widely applicable. For these reasons, in this paper we investigate privacy in the context of trust negotiations. We propose a set of privacy preserving features for inclusion in any trust negotiation system, such as the support for the P3P standard as well as a number of innovative features such as a novel format for encoding digital credentials specifically designed for preserving privacy. Further, we present a variety of interoperable strategies to carry on the negotiation with the aim of improving both privacy and efficiency.
An integrated approach to federated identity and privilege management in open systems.

A roadmap for comprehensive online privacy policy management.
Information technology advances are making Internet and Web-based system use the common choice in many application domains, ranging from business to healthcare to scientific collaboration and distance learning. However, adoption is slowed by wellfounded concerns about privacy, especially given that data collected about individuals is being combined with information from other sources and analyzed by means of powerful tools (i.e., data mining tools). Effective solutions for privacy protection are of interest to industry, government and society at large, but the challenge is to satisfy the oftenconflicting requirements of all these stakeholders. Enterprises need mechanisms to ensure that their systems are compliant with both the policies they articulate and law. Moreover, they need to understand how to specify, deploy, communicate and enforce privacy policies. Legislators and regulatory bodies need mechanisms to verify how privacyrelated laws are actually enforced by enterprises in their software systems. Finally, endusers must be able to easily understand privacy policies [AEB04] and need effective, transparent and comprehensible online privacy-protection mechanisms. Significant efforts in industry are seeking to better protect sensitive information
Modeling and language support for the management of pattern%2Dbases.
In our days knowledge extraction methods are able to produce artifacts (also called patterns) that concisely represent data. Patterns are usually quite heterogeneous and require ad-hoc processing techniques. So far, little emphasis has been posed on developing an overall integrated environment for uniformly representing and querying different types of patterns. Within the larger context of modelling, storing, and querying patterns, in this paper, we: (a) formally define the logical foundations for the global setting of pattern management through a model that covers data, patterns and their intermediate mappings; (b) present a pattern specification language for pattern management along with safety restrictions; and (c) introduce queries and query operators and identify interesting query classes.
Replacing Lost or Stolen E%2DPassports.

Trust Negotiation in Identity Management.

A Critique of the ANSI Standard on Role%2DBased Access Control.
The American National Standard Institute (ANSI) Standard on Role-Based Access Control (RBAC) was approved in 2004 to fulfil “a need among government and industry purchasers of information technology products for a consistent and uniform definition of role based access control (RBAC) features” [1]. The development of the ANSI RBAC standard represents an important milestone and will enhance portability and interoperability of applications and access control policies. The current version of the standard, however, has limitations, design flaws, and technical errors. In this article, we identify critical design problems in the current ANSI RBAC standard and suggest how they can be addressed. We also analyze several critical features of RBAC, such as sessions, hierarchies, and constraints, and discuss how they should be supported in RBAC models. We believe that our analysis will contribute to improvements in the RBAC standard and, more broadly, in the understanding of RBAC.
An Analysis Study on Zone%2DBased Anonymous Communication in Mobile Ad Hoc Networks.

A system for securing push%2Dbased distribution of XML documents.

A dynamic key management solution to access hierarchy.

Privacy preserving multi%2Dfactor authentication with biometrics.
Abstract. An emerging approach to the problem of identity theft is represented by the adoption of biometric authentication systems. Such systems however present several challenges, related to privacy, reliability and security of the biometric data. Inter-operability is also required among the devices used for authentication. Moreover, very often biometric authentication in itself is not sufficient as a conclusive proof of identity and has to be complemented with multiple other proofs of identity such as passwords, SSN, or other user identifiers. Multi-factor authentication mechanisms are thus required to enforce strong authentication based on the biometric and identifiers of other nature. In this paper we propose a two-phase authentication mechanism for federated identity management systems. The first phase consists of a two-factor biometric authentication based on zero knowledge proofs. We employ techniques from the vector-space model to generate cryptographic biometric keys. These keys are kept secret, thus preserving the confidentiality of the biometric data, and at the same time exploit the advantages of biometric authentication. The second phase combines several authentication factors in conjunction with the biometric to provide a strong authentication. A key advantage of our approach is that any unanticipated combination of factors can be used. Such authentication system leverages the information of the user that are available from the federated identity management system.
A semantic approach to build personalized interfaces in the cultural heritage domain.

A Decentralized Approach for Controlled Sharing of Resources in Virtual Communities.

Policy Languages for Digital Identity Management in Federation Systems.

Privacy preserving multi%2Dfactor authentication with biometrics.
Abstract. An emerging approach to the problem of identity theft is represented by the adoption of biometric authentication systems. Such systems however present several challenges, related to privacy, reliability and security of the biometric data. Inter-operability is also required among the devices used for authentication. Moreover, very often biometric authentication in itself is not sufficient as a conclusive proof of identity and has to be complemented with multiple other proofs of identity such as passwords, SSN, or other user identifiers. Multi-factor authentication mechanisms are thus required to enforce strong authentication based on the biometric and identifiers of other nature. In this paper we propose a two-phase authentication mechanism for federated identity management systems. The first phase consists of a two-factor biometric authentication based on zero knowledge proofs. We employ techniques from the vector-space model to generate cryptographic biometric keys. These keys are kept secret, thus preserving the confidentiality of the biometric data, and at the same time exploit the advantages of biometric authentication. The second phase combines several authentication factors in conjunction with the biometric to provide a strong authentication. A key advantage of our approach is that any unanticipated combination of factors can be used. Such authentication system leverages the information of the user that are available from the federated identity management system.
Secure Dissemination of XML Content Using Structure%2Dbased Routing.

Trust Negotiations with Customizable Anonymity.

Private Updates to Anonymous Databases.

Technique for Optimal Adaptation of Time%2DDependent Workflows with Security Constraints.

Access Control and Authorization Constraints for WS%2DBPEL.
Computerized workflow systems have attracted considerable research interest in the last fifteen years. More recently, there have been several XML-based languages proposed for specifying and orchestrating business processes, culminating in WS-BPEL. A significant omission from WS-BPEL is the ability to specify authorization information associating users with activities in the business process and authorization constraints on the execution of activities such as separation of duty. In this paper, we address these deficiencies by developing the RBAC-WS-BPEL and BPCL languages. The first of these provides for the specification of authorization information associated with a business process specified in WS-BPEL, while BPCL provides for the articulation of authorization constraints. 1.
Security in SOA and Web Services.
Information and Statistics
Access Control and Privacy in Location%2DAware Services forMobile Organizations.

Achieving Anonymity in Mobile Ad Hoc Networks Using Fuzzy Position Information.

Policy Languages for Digital Identity Management in Federation Systems.

Digital identity management and protection.

Preserving User Location Privacy in Mobile Data Management Infrastructures.
Abstract. Location-based services, such as finding the nearest gas station, require users to supply their location information. However, a user’s location can be tracked without her consent or knowledge. Lowering the spatial and temporal resolution of location data sent to the server has been proposed as a solution. Although this technique is effective in protecting privacy, it may be overkill and the quality of desired services can be severely affected. In this paper, we suggest a framework where uncertainty can be controlled to provide high quality and privacy-preserving services, and investigate how such a framework can be realized in the GPS and cellular network systems. Based on this framework, we suggest a data model to augment uncertainty to location data, and propose imprecise queries that hide the location of the query issuer and yields probabilistic results. We investigate the evaluation and quality aspects for a range query. We also provide novel methods to protect our solutions against trajectory-tracing. Experiments are conducted to examine the effectiveness of our approaches. 1
Beyond k%2DAnonymity A Decision Theoretic Framework for Assessing Privacy Risk.
An important issue any organization or individual has to face when managing data containing sensitive information, is the risk that can be incurred when releasing such data. Even though data may be sanitized before being released, it is still possible for an adversary to reconstruct the original data using additional information thus resulting in privacy violations. To date, however, a systematic approach to quantify such risks is not available. In this paper we develop a framework, based on statistical decision theory, that assesses the relationship between the disclosed data and the resulting privacy risk. We model the problem of deciding which data to disclose, in terms of deciding which disclosure rule to apply to a database. We assess the privacy risk by taking into account both the entity identification and the sensitivity of the disclosed information. Furthermore, we prove that, under some conditions, the estimated privacy risk is an upper bound on the true privacy risk. Finally, we relate our framework with the k-anonymity disclosure method. The proposed framework makes the assumptions behind k-anonymity explicit, quantifies them, and extends them in several natural directions. I.
Traceable and Automatic Compliance of Privacy Policies in Federated Digital Identity Management.

Beyond k%2DAnonymity A Decision Theoretic Framework for Assessing Privacy Risk.
An important issue any organization or individual has to face when managing data containing sensitive information, is the risk that can be incurred when releasing such data. Even though data may be sanitized before being released, it is still possible for an adversary to reconstruct the original data using additional information thus resulting in privacy violations. To date, however, a systematic approach to quantify such risks is not available. In this paper we develop a framework, based on statistical decision theory, that assesses the relationship between the disclosed data and the resulting privacy risk. We model the problem of deciding which data to disclose, in terms of deciding which disclosure rule to apply to a database. We assess the privacy risk by taking into account both the entity identification and the sensitivity of the disclosed information. Furthermore, we prove that, under some conditions, the estimated privacy risk is an upper bound on the true privacy risk. Finally, we relate our framework with the k-anonymity disclosure method. The proposed framework makes the assumptions behind k-anonymity explicit, quantifies them, and extends them in several natural directions. I.
Architectural issues for a location%2Daware role%2Dbased access control system.

Access control%2C confidentiality and privacy for video surveillance databases.

Systematic control and management of data integrity.

XACML policy integration algorithms not to be confused with XACML policy combination algorithms%21

Fine%2Dgrained role%2Dbased delegation in presence of the hybrid role hierarchy.
Delegation of authority is an important process that needs to be captured by any access control model. In role-based access control models, delegation of authority involves delegating roles that a user can assume or the set of permissions that he can acquire, to other users. Several role-based delegation models have been proposed in the literature. However, these models consider delegation in presence of the general hierarchy type. Multiple hierarchy types have been proposed in the context of Generalized Temporal Role-based Access Control (GTRBAC) model, where it has been shown that multiple hierarchy semantics is desirable to express fine-grained access control policies. In this paper, we address role-based delegation schemes in the of hybrid hierarchies and elaborate on fine-grained delegation schemes. In particular, we show that upward delegation, which has been considered as having no practical use, is a desirable feature. Furthermore, we show that accountability must be considered as an important factor during the delegation process. The delegation framework proposed subsumes delegations schemes proposed in earlier rolebased delegation models and provide much more fine-grained control of delegation semantics.
Towards a contextualized access to the cultural heritage world using 360 Panoramic Images.

Secure Anonymization for Incremental Datasets.
Abstract. Data anonymization techniques based on the k-anonymity model have been the focus of intense research in the last few years. Although the k-anonymity model and the related techniques provide valuable solutions to data privacy, current solutions are limited only to static data release (i.e., the entire dataset is assumed to be available at the time of release). While this may be acceptable in some applications, today we see databases continuously growing everyday and even every hour. In such dynamic environments, the current techniques may suffer from poor data quality and/or vulnerability to inference. In this paper, we analyze various inference channels that may exist in multiple anonymized datasets and discuss how to avoid such inferences. We then present an approach to securely anonymizing a continuously growing dataset in an efficient manner while assuring high data quality. 1
Access control enforcement for conversation%2Dbased web services.
Service Oriented Computing is emerging as the main approach to build distributed enterprise applications on the Web. The widespread use of Web services is hindered by the lack of adequate security and privacy support. In this paper, we present a novel framework for enforcing access control in conversation-based Web services. Our approach takes into account the conversational nature of Web services. This is in contrast with existing approaches to access control enforcement that assume a Web service as a set of independent operations. Furthermore, our approach achieves a tradeoff between the need to protect Web service’s access control policies and the need to disclose to clients the portion of access control policies related to the conversations they are interested in. This is important to avoid situations where the client cannot progress in the conversation due to the lack of required security requirements. We introduce the concept of k-trustworthiness that defines the conversations for which a client can provide credentials maximizing the likelihood that it will eventually hit a final state. Categories and Subject Descriptors
Controlled and cooperative updates of XML documents in byzantine and failure%2Dprone distributed systems.

Foreword.
reference set of international guidelines and recommendations for the reporting and presentation of statistical data and metadata. Although, the Handbook was prepared primarily for short-term economic statistics, many, if not most of the recommendations presented are also relevant for annual (structural) statistics and for social and population statistics. The Handbook draws heavily on existing international statistical guidelines and recommendations that have been developed over the last twenty years by international organisations and national statistical agencies. These international standards have been developed for implementation by international organisations themselves and by national agencies in both developed and developing economies. The need for the articulation of a comprehensive set of recommendations on the reporting and presentation of statistical data and metadata is one aspect of the overall demand for improved international comparability and consistency of statistics compiled and published by national agencies and international organisations. This requirement has itself been driven by closer economic and social linkages between both the 30 OECD Member countries and between those countries and large emerging non-member economies. As discussed in the Handbook, the major causes of differences in statistics compiled in different countries flow from the use of different definitions and concepts and
Policies and IT Technologies A Puzzle of Two Pieces.

Achieving Privacy in Trust Negotiations with an Ontology%2DBased Approach.

X%2DFEDERATE A Policy Engineering Framework for Federated Access Management.
Abstract—Policy-Based Management (PBM) has been considered as a promising approach for design and enforcement of access management policies for distributed systems. The increasing shift toward federated information sharing in the organizational landscape, however, calls for revisiting current PBM approaches to satisfy the unique security requirements of the federated paradigm. This presents a twofold challenge for the design of a PBM approach, where, on the one hand, the policy must incorporate the access management needs of the individual systems, while, on the other hand, the policies across multiple systems must be designed in such a manner that they can be uniformly developed, deployed, and integrated within the federated system. In this paper, we analyze the impact of security management challenges on policy design and formulate a policy engineering methodology based on principles of software engineering to develop a PBM solution for federated systems. We present X-FEDERATE, a policy engineering framework for federated access management using an extension of the well-known Role-Based Access Control (RBAC) model. Our framework consists of an XML-based policy specification language, its UML-based meta-model, and an enforcement architecture. We provide a comparison of our framework with related approaches and highlight its significance for federated access management. The paper also presents a federation protocol and discusses a prototype of our framework that implements the protocol in a federated digital library environment. Index Terms—Federated systems, software engineering, security management, role-based access control. 1
Secure knowledge management confidentiality%2C trust%2C and privacy.
Abstract—Knowledge management enhances the value of a corporation by identifying the assets and expertise as well as efficiently managing the resources. Security for knowledge management is critical as organizations have to protect their intellectual assets. Therefore, only authorized individuals must be permitted to execute various operations and functions in an organization. In this paper, secure knowledge management will be discussed, focusing on confidentiality, trust, and privacy. In particular, certain access-control techniques will be investigated, and trust management as well as privacy control for knowledge management will be explored. Index Terms—Data mining, privacy, role-based access control (RBAC), secure knowledge management, security policy, semantic web, trust negotiation (TN), usage control (UCON). I.
Workflow authorisation in mediator%2Dfree environments.

A secure framework for publishing virtual community contracts.

An Adaptive Access Control Model for Web Services.

A multigranular object%2Doriented framework supporting spatio%2Dtemporal granularity conversions.

Establishing and protecting digital identity in federation systems.

Micro%2Dviews
Abstract. A data mining system can semi-automatically discover knowledge by mining a large volume of data, but the discovered knowledge is not always novel and may contain unreasonable facts. We try to develop a discovered rule filtering method to filter rules discovered by a data mining system to be novel and reasonable ones for the user by using information retrieval technique. In this method, we rank discovered rules according to the results of information retrieval from an information source on the Internet. In this paper, we show two approaches toward discovered rule filtering; micro view approach and macro view approach. The micro view approach tries to retrieve and show documents directly related to discovered rules. On the other hand, the macro view approach tries to show research activities related to discovered rules by using the results of information retrieval. We discuss advantages and disadvantages of micro view approach and possibilities of macro view approach by using an example of clinical data mining and MEDLINE document retrieval. 1
Ws%2DAC A Fine Grained Access Control System for Web Services.

Journal on Data Semantics II

Advances in Spatial and Temporal Databases
We present here a theory of motion from a topological point of view, in a symbolic perspective. Taking space-time histories of objects as primitive entities, we introduce temporal and topological relations on the thus defined space-time to characterize classes of spatial changes. The theory thus accounts for qualitative spatial information, dealing with underspecified, symbolic information when accurate data is not available or unnecessary. We show that these structures give a basis for commonsense spatio-temporal reasoning by presenting a number of significant deductions in the theory. This can serve as a formal basis for languages describing motion events in a qualitative way.
Secure collaboration in mediator%2Dfree environments.
The internet and related technologies have made multidomain collaborations a reality. Collaboration enables domains to effectively share resources; however it introduces several security and privacy challenges. Managing security in the absence of a central mediator is even more challenging. In this paper, we propose a distributed secure interoperability framework for mediator-free collaboration environments. We introduce the idea of secure access paths which enables domains to make localized access control decisions without having global view of the collaboration. We also present a path authentication technique for proving path authenticity. Furthermore, we present both a proactive and on-demand path discovery algorithms that enable domains to securely discover paths in the collaboration environment.
Intrusion Detection in RBAC%2Dadministered Databases.
A considerable effort has been recently devoted to the development of Database Management Systems (DBMS) which guarantee high assurance security and privacy. An important component of any strong security solution is represented by intrusion detection (ID) systems, able to detect anomalous behavior by applications and users. To date, however, there have been very few ID mechanisms specifically tailored to database systems. In this paper, we propose such a mechanism. The approach we propose to ID is based on mining database traces stored in log files. The result of the mining process is used to form user profiles that can model normal behavior and identify intruders. An additional feature of our approach is that we couple our mechanism with Role Based Access Control (RBAC). Under a RBAC system permissions are associated with roles, usually grouping several users, rather than with single users. Our ID system is able to determine role intruders, that is, individuals that while holding a specific role, have a behavior different from the normal behavior of the role. An important advantage of providing an ID mechanism specifically tailored to databases is that it can also be used to protect against insider threats. Furthermore, the use of roles makes our approach usable even for databases with large user population. Our preliminary experimental evaluation on both real and synthetic database traces show that our methods work well in practical situations. 1.
An Object%2DRelational Approach to the Representation of Multi%2Dgranular Spatio%2DTemporal Data.
Abstract. The notion of spatio-temporal multi-granularity is fundamental when modeling objects in GIS applications in that it supports the representation of the temporal evolutions of these objects. Concepts and issues in multi-granular spatio-temporal representations have been widely investigated by the research community. However, despite the large number of theoretical investigations, no comprehensive approaches, have been proposed dealing with the representation of multi-granular spatio-temporal objects in commercially available DBMSs. The goal of the work that we report in this paper is to address this gap. To achieve it, the paper first introduces an object-relational model based on OpenGis specifications described in SQL3. Several extensions are developed in order to improve the semantics and behavior for spatio-temporal data types introducing an approach to represent the temporal dimension in this model and the multi-representation of spatio-temporal granularities. 1
A novel approach for privacy%2Dpreserving video sharing.

Securing XML data in third%2Dparty distribution systems.
Web-based third-party architectures for data publishing are today receiving growing attention, due to their scalability and the ability to efficiently manage large numbers of users and great amounts of data. A third-party architecture relies on a distinction between the Owner and the Publisher of information. The Owner is the producer of information, whereas Publisher provides data management services and query processing functions for (a portion of) the Owner’s information. In such architecture, there are important security concerns especially if we do not want to make any assumption on the trustworthy of the Publishers. Although approaches have been proposed [4, 5] providing partial solutions to this problem, no comprehensive framework has been so far developed able to support all the most important security properties in the presence of an untrusted Publisher. In this paper, we develop an XML-based solution to such problem, which makes use of non-conventional digital signature techniques and queries over encrypted data.
Purpose Based Access Control for Privacy Protection in Database Systems.

A Multi%2DStrategy Approach to Rating and Filtering Online Resources.

Integration of Virtual Reality and Database System Techniques.

Information Driven Evaluation of Data Hiding Algorithms.
Abstract. Privacy is one of the most important properties an information system must satisfy. A relatively new trend shows that classical access control techniques are not sufficient to guarantee privacy when datamining techniques are used. Privacy Preserving Data Mining (PPDM) algorithms have been recently introduced with the aim of modifying the database in such a way to prevent the discovery of sensible information. Due to the large amount of possible techniques that can be used to achieve this goal, it is necessary to provide some standard evaluation metrics to determine the best algorithms for a specific application or context. Currently, however, there is no common set of parameters that can be used for this purpose. This paper explores the problem of PPDM algorithm evaluation, starting from the key goal of preserving of data quality. To achieve such goal, we propose a formal definition of data quality specifically tailored for use in the context of PPDM algorithms, a set of evaluation parameters and an evaluation algorithm. The resulting evaluation core process is then presented as a part of a more general three step evaluation framework, taking also into account other aspects of the algorithm evaluation such as efficiency, scalability and level of privacy. 1
Access control management in a distributed environment supporting dynamic collaboration.
Ensuring secure and authorized access to remote services and information resources in a dynamic collaborative environment is a challenging task. Two major issues that need to be addressed in this regard are: specification of access control requirements and trust management. Specification of access control requirements for dynamic collaboration is challenging mainly because of the limited or lack of knowledge about remote users ’ identities and affiliations. The access control policies and constraints defining users ’ authorization over remote resources and services need to be specified in terms of the attributes and properties of the users. Moreover, the criteria for validating the attributes of the users should also be specified as part of access control requirements. Trust management, in the context of dynamic collaboration, involves validation of user’s attributes for secure interaction and prevention of unauthorized disclosure of policies and attributes. The paper discusses these issues in detail and presents a framework for access control and trust management in a distributed collaborative environment.
Establishing and protecting digital identity in federation systems.

Privacy%2DPreserving Database Systems.
Abstract—As organizations increase their reliance on, possibly distributed, information systems for daily business, they become more vulnerable to security breaches even as they gain productivity and efficiency advantages. Though a number of techniques, such as encryption and electronic signatures, are currently available to protect data when transmitted across sites, a truly comprehensive approach for data protection must also include mechanisms for enforcing access control policies based on data contents, subject qualifications and characteristics, and other relevant contextual information, such as time. It is well understood today that the semantics of data must be taken into account in order to specify effective access control policies. Also, techniques for data integrity and availability specifically tailored to database systems must be adopted. In this respect, over the years the database security community has developed a number of different techniques and approaches to assure data confidentiality, integrity, and availability. However, despite such advances, the database security area faces several new challenges. Factors such as the evolution of security concerns, the “disintermediation ” of access to data, new computing paradigms and applications, such as grid-based computing and ondemand business, have introduced both new security requirements and new contexts in which to apply and possibly extend current approaches. In this paper, we first survey the most relevant concepts underlying the notion of database security and summarize the most well-known techniques. We focus on access control systems, on which a large body of research has been devoted, and describe the key access control models, namely, the discretionary and mandatory access control models, and the role-based access control (RBAC) model. We also discuss security for advanced data management systems, and cover topics such as access control for XML.
An Update Protocol for XML Documents in Distributed and Cooperative Systems.
Securing data is becoming a crucial need for most internet-based applications. Whereas the problem of data confidentiality has been widely investigated, the problem of how to ensure that data, when moving among different parties, are modified only according to the stated policies has been so far not deeply investigated. In this paper, we propose an approach supporting parallel and distributed secure updates to XML documents. The approach, based on the use of a security region-object parallel flow (S-RPF) graph protocol, is particularly suited for all environments requiring cooperative updates to XML documents. It allows different users to simultaneously update different portions of the same document, according to the specified access control policies. Additionally, it supports a decentralized management of update operations in that a subject can exercise its privileges and verify the correctness of the operations performed so far on the document without interacting, in most of the cases, with the document server. 1.
Privacy and Ownership Preserving of Outsourced Medical Data.
The demand for the secondary use of medical data is increasing steadily to allow for the provision of better quality health care. Two important issues pertaining to this sharing of data have to be addressed: one is the privacy protection for individuals referred to in the data; the other is copyright protection over the data. In this paper, we present a unified framework that seamlessly combines techniques of binning and digital watermarking to attain the dual goals of privacy and copyright protection. Our binning method is built upon an earlier approach of generalization and suppression by allowing a broader concept of generalization. To ensure data usefulness, we propose constraining Binning by usage metrics that define maximal allowable information loss, and the metrics can be enforced off-line. Our watermarking algorithm watermarks the binned data in a hierarchical manner by leveraging on the very nature of the data. The method is resilient to the generalization attack that is specific to the binned data, as well as other attacks intended to destroy the inserted mark. We prove that watermarking could not adversely interfere with binning, and implemented the framework. Experiments were conducted, and the results show the robustness of the proposed framework. 1
Assuring Security Properties in Third%2Dparty Architectures.

A Constraint%2DBased Approach for the Authoring of Multi%2DTopic Multimedia Presentations.

P%2DHera Scalable fine%2Dgrained access control for P2P infrastructures.
In this paper, we present P-Hera, a peer-to-peer (P2P) infrastructure for scalable and secure content hosting. P-Hera allows the users and content owners to dynamically establish trust using fine-grained access control. In P-Hera, resource owners can specify fine-grained restrictions on who can access their resources and which user can access which part of data. We differentiate our work with traditional works of fine-grained access control on Web services, as our system in addition to handling access constrains of the service provider (which is the case in Web services), it also handles security constrains regarding actions performed on data: replication and modification. We believe this is of immense significance for wide-range of applications such as data Grids, Information Grids and Web Content Delivery Networks. In addition to presenting the overall system architecture, we also study the problem of evaluating these fine-grained access policies in depth and propose a novel means of organizing these policies that can result in faster evaluation. We demonstrate the effectiveness of our approach using prototype implementation.
An Integrated Approach to Rating and Filtering Web Content.
Abstract. In this poster, we will illustrate an integrated approach to Web filtering, whose main features are flexible filtering policies taking into account both users ’ characteristics and resource content, the specification of an ontology for the filtering domain, and the support for the main filtering strategies currently available. Our approach has been implemented in two prototypes, which address the needs of both home and institutional users, and which enforce filtering strategies more sophisticated and flexible than the ones currently available. Web content filtering concerns the evalutation of Web resources in order to verify whether they satisfy given parameters. Although such definition is quite general, and it applies to diverse applications, Web filtering has been enforced so far mainly in order to protect users (e.g., minors) from possible ‘harmful’ content (e.g., pornography, violence, racism). The filtering systems currently available can be grouped into two main classes. The former adopts a list-based approach, according to which Web sites are classified
Efficient Integration of Fine%2Dgrained Access Control in Large%2Dscale Grid Services.
In this paper, we present a scalable authorization service, based on the concept of fine-grained access control (FGAC), for large-scale Grid infrastructures that span multiple independent domains. FGAC enables participating resource owners to specify fine-grained policies concerning which user can access can their resources under which mode. We argue that such an authorization service must be integrated with the resource broker service to avoid scheduling requests onto resources which do not authorize the user request. For this reason, we develop a novel resource broker service that integrates access control with resource scheduling. In our system, both resource owners and users define their resource access and usage policies. The resource broker schedules a user request only within the set of resources whose policies match the user credentials (and vice-versa). Since this process of evaluating authorization policies of resources and user, in addition to checking the resource requirement, can be a potential bottleneck for a large scale Grid, we also analyze the problem of efficient evaluation of FGAC policies. In this context, we present a novel method for policy organization and compare its performance with other strategies. Preliminary results show that the proposed method can significantly enhance performance. 1
Spatial Knowledge%2DBased Applications and Technologies Research Issues.

Dissemination of Cultural Heritage Content through Virtual Reality and Multimedia Techniques A Case Study.

PDL with Preferences.
In the context of Network management, Chomicki, Lobo and Naqvi have defined the specification language Policy Description Language (PDL) and later extended it by introducing monitors: constraints on the actions that the network manager can execute simultaneously. This article proposes PPDL, an extension of PDL with Preferences, that allows the specification of user-defined preferences on how to apply monitors. The new language adopts Brewka’s approach to preferences introducing the “× ” ordered disjunction connective. We illustrate the feature of PPDL in two interesting application examples: i) the specification of “separation of duties ” constraints on user/role assignments in a workflow scenario and ii) an architecture for Web services selection. Since PPDL (as well as PDL) policy specifications can be computed by means of translation into Answer Set programs, we are able to provide an integrated framework based on answer set programming inferential engine.
Anonymity Preserving Techniques in Trust Negotiations.
Abstract. Trust negotiation between two subjects require each one proving its properties to the other. Each subject specifies disclosure policies stating the types of credentials and attributes the counterpart has to provide to obtain a given resource. The counterpart, in response, provides a disclosure set containing the necessary credentials and attributes. If the counterpart wants to remain anonymous, its disclosure sets should not contain identity revealing information. In this paper, we propose anonymization techniques using which a subject can transform its disclosure set into an anonymous one. Anonymization transforms a disclosure set into an alternative anonymous one whose information content is different from the original one. This alternative disclosure set may no longer satisfy the original disclosure policy causing the trust negotiation to fail. To address this problem, we propose that trust negotiation requirements be expressed at a more abstract level using property-based policies. Property-based policies state the high-level properties that a counterpart has to provide to obtain a resource. A property-based policy can be implemented by a number of disclosure policies. Although these disclosure policies implement the same high-level property-based policy, they require different sets of credentials. Allowing the subject to satisfy any policy from the set of disclosure policies, increases not only the chances of a trust negotiation succeeding but also the probability of ensuring anonymity. 1
Reasoning about RDF statements with default rules.

Purpose based access control of complex data for privacy protection.
As privacy becomes a major concern for both consumers and enterprises, many research efforts have been devoted to the development of privacy protecting technology. We recently proposed a privacy preserving access control model for relational databases, where purpose information associated with a given data element specifies the intended use of the data element. In this paper, we extend our previous work to handle other advanced data management systems, such as the ones based on XML and the ones based on the object-relational data model. Another contribution of our paper is that we address the problem of how to determine the purpose for which certain data are accessed by a given user. Our proposed solution relies on the well-known RBAC model as well as the notion of conditional role which is based on the notions of role attribute and system attribute. 1.
SERAT SEcure role mApping technique for decentralized secure interoperability.
Multi-domain application environments where distributed domains interoperate with each other are becoming a reality in internet-based and web-services based enterprise applications. The secure interoperation in a multidomain environment is a challenging problem. In this paper, we propose a distributed secure interoperability protocol that ensures secure interoperation of the multiple collaborating domains without compromising the security of collaborating domains. We introduce the idea of access paths and access paths constraints. Furthermore, we device a path discovery algorithm that is capable of querying interoperating domains for the set of secure access paths between different domains.
GEO%2DRBAC a spatially aware RBAC.
Securing access to data in location-based services and mobile applications requires the definition of spatially aware access control systems. Even if some approaches have already been proposed either in the context of geographic database systems or context-aware applications, a comprehensive framework, general and flexible enough to cope with spatial aspects in real mobile applications, is still missing. In this paper, we make one step towards this direction and we present GEO-RBAC, an extension of the RBAC model to deal with spatial and location-based information. In GEO-RBAC, spatial entities are used to model objects, user positions, and geographically bounded roles. Roles are activated based on the position of the user. Besides a physical position, obtained from a given mobile terminal or a cellular phone, users are also assigned a logical and device independent position, representing the feature (the road, the town, the region) in which they are located. To make the model more flexible and re-usable, we also introduce the concept of role schema, specifying the name of the role as well as the type of the role spatial boundary and the granularity of the logical position. We then extend GEO-RBAC to cope with hierarchies, modeling permission, user, and activation inheritance, and separation of duty constraints. The proposed classes of constraints extend traditional ones to deal with different granularities (schema/instance
X%2DGTRBAC an XML%2Dbased policy specification framework and architecture for enterprise%2Dwide access control.
To my parents, for without them I wouldn’t have accomplished this milestone.- iii ACKNOWLEDGMENTS Acknowledgement is due to my advisor Prof. Arif Ghafoor, without whose support this thesis would not have seen the light of day. Also to be acknowledged are my committee members, Prof. Charlie Hu and Prof. Hong Tan, for their valuable input and encouragement. The guidance from Prof. Elisa Bertino at Università di Milano, Milano, Italy has been instrumental in the evolution of this work. Last but not the least, the research presented in this thesis has been partially supported by the National Science
X%2Dgtrbac admin A decentralized administration model for enterprise%2Dwide access control.
The modern enterprise spans several functional units or administrative domains with diverse authorization requirements. Access control policies in an enterprise environment typically express these requirements as authorization constraints. While desirable for access control, constraints can lead to conflicts in the overall policy in a multidomain environment. The administration problem for enterprise-wide access control, therefore, not only includes authorization management for users and resources within a single domain but also conflict resolution among heterogeneous access control policies of multiple domains to allow secure interoperation within the enterprise. This work presents design and implementation of X-GTRBAC Admin, an administration model that aims at enabling administration of role-based access control (RBAC) policies in the presence of constraints with support for conflict resolution in a multidomain environment. A key feature of the model is that it allows decentralization of policy administration tasks through the abstraction of administrative domains, which not only simplifies authorization management, but is also fundamental to the concept of decentralized conflict resolution presented. The paper also illustrates the applicability of the outlined administrative concepts in a realistic enterprise environment using an implementation prototype that facilitates policy administration in large enterprises.
A Framework for Evaluating Privacy Preserving Data Mining Algorithms.
Abstract. Recently, a new class of data mining methods, known as privacy preserving data mining (PPDM) algorithms, has been developed by the research community working on security and knowledge discovery. The aim of these algorithms is the extraction of relevant knowledge from large amount of data, while protecting at the same time sensitive information. Several data mining techniques, incorporating privacy protection mechanisms, have been developed that allow one to hide sensitive itemsets or patterns, before the data mining process is executed. Privacy preserving classification methods, instead, prevent a miner from building a classifier which is able to predict sensitive data. Additionally, privacy preserving clustering techniques have been recently proposed, which distort sensitive numerical attributes, while preserving general features for clustering analysis. A crucial issue is to determine which ones among these privacy-preserving techniques better protect sensitive information. However, this is not the only criteria with respect to which these algorithms can be evaluated. It is also important to assess the quality of the data resulting from the modifications applied by each algorithm, as well as the performance of the algorithms. There is thus the need of identifying a comprehensive set of criteria with respect to which to assess the existing PPDM algorithms and determine which algorithm meets specific requirements. In this paper, we present a first evaluation framework for estimating and comparing different kinds of PPDM
A Trust%2DBased Context%2DAware Access Control Model for Web%2DServices.
A key challenge in Web services security is the design of effective access control schemes that can adequately meet the unique security challenges posed by the Web services paradigm. Despite the recent advances in Web based access control approaches applicable to Web services, there remain issues that impede the development of effective access control models for Web services environment. Amongst them are the lack of context-aware models for access control, and reliance on identity or capability-based access control schemes. In this paper, we motivate the design of an access control scheme that addresses these issues, and propose an extended, trust-enhanced version of our XML-based Role Based Access Control (X-RBAC) framework that incorporates context-based access control. We outline the configuration mechanism needed to apply our model to the Web services environment, and also describe the implementation architecture for the system. Keywords: XML, Role-Based Access Control, Trust Management, Web-Services 1.
Database Security%2DConcepts%2C Approaches%2C and Challenges.
Abstract—As organizations increase their reliance on, possibly distributed, information systems for daily business, they become more vulnerable to security breaches even as they gain productivity and efficiency advantages. Though a number of techniques, such as encryption and electronic signatures, are currently available to protect data when transmitted across sites, a truly comprehensive approach for data protection must also include mechanisms for enforcing access control policies based on data contents, subject qualifications and characteristics, and other relevant contextual information, such as time. It is well understood today that the semantics of data must be taken into account in order to specify effective access control policies. Also, techniques for data integrity and availability specifically tailored to database systems must be adopted. In this respect, over the years the database security community has developed a number of different techniques and approaches to assure data confidentiality, integrity, and availability. However, despite such advances, the database security area faces several new challenges. Factors such as the evolution of security concerns, the “disintermediation ” of access to data, new computing paradigms and applications, such as grid-based computing and ondemand business, have introduced both new security requirements and new contexts in which to apply and possibly extend current approaches. In this paper, we first survey the most relevant concepts underlying the notion of database security and summarize the most well-known techniques. We focus on access control systems, on which a large body of research has been devoted, and describe the key access control models, namely, the discretionary and mandatory access control models, and the role-based access control (RBAC) model. We also discuss security for advanced data management systems, and cover topics such as access control for XML.
An Analysis of Expressiveness and Design Issues for the Generalized Temporal Role%2DBased Access Control Model.

A Generalized Temporal Role%2DBased Access Control Model.
A temporal RBAC (TRBAC) model has recently been proposed that addresses the temporal aspects of roles and trigger-based role enabling. However, it is limited to constraints on enabling of roles only. We propose a Generalized Temporal Role Based Access Control model (GTRBAC) that is capable of expressing a wider range of temporal constraints. GTRBAC is capable of expressing periodic as well as duration constraints on roles, user-role assignments and role-permission assignments. In GTRBAC, temporal constraints on role enablings and role activations can be separately specified. A user-activated role can further be restricted to various activation constraints such as cardinality constraint or maximum active duration constraint within a specified interval. The GTRBAC model extends the synta ctic structure of TRBAC model and its event and trigger expressions subsume those of TRBAC. Portions of this work were supported by the sponsors of the Center for Education and Role based access control (RBAC) models have generated great interest in the security community as a powerful and generalized approach to security [2, 13, 16, 18, 19]. In RBAC,
Secure Interoperation in a Multidomain Environment Employing RBAC Policies.

Towards structure discovering in video data.

An approach to cooperative updates of XML documents in distributed systems.
corresponding author Protection and secure exchange of Web documents is becoming a crucial need for many internetbased applications. Securing Web documents entail addressing two main issues: confidentiality and integrity. Ensuring document confidentiality means that document contents can only be disclosed to subjects authorized according to specified security policies, whereas by document integrity we mean that the document contents are correct with respect to a given application domain and that the document contents are modified only by authorized subjects. Whereas the problem of document confidentiality has been widely investigated in the literature, the problem of how to ensure that a document, when moving among different parties, is modified only according to the stated policies still lacks comprehensive solutions. In this paper we present a solution to this problem by proposing a model for specifying update policies, and an infrastructure supporting the specification and enforcement of these policies in a distributed and cooperative environment, in which subjects in different organizational roles can modify possibly different portions of the same document. The key aspect of our proposal is that, by using a combination of hash functions and digital signature techniques,
The Indiana Center for Database Systems at Purdue University.
Work flow management requires language support for work flow specification and task specification. Many approaches and systems for work flow management therefore offer at least one new language for work flow specification; task specification is usually done in a traditional language. This is motivated in particular by the fact that many components already exist and the task of the work flow tool is the specification of the interaction between these components. The intention of this article is to demonstrate that a general purpose programming language can serve both aspects. We do not really see the need to develop yet another language that a user or application programmer must learn. If an existing programming language like C or Prolog is extended towards work flow capabilities, it is easy to reuse autonomous existing software components and to build interfaces among them.
An apples%2Dto%2Dapples comparison of two database journals.
This paper defines a collection of metrics on manuscript reviewing and presents historical data for ACM Transactions on Database Systems and The VLDB Journal.
Advances in Database Technology %2D EDBT 2004

Purpose based access control for privacy protection.
In this paper, we present a comprehensive approach for privacy preserving access control based on the notion of purpose. Purpose information associated with a given data element specifies the intended use of the data element, and our model allows multiple purposes to be associated with each data element. A key feature of our model is that it also supports explicit prohibitions, thus allowing privacy officers to specify that some data should not be used for certain purposes. Another important issue addressed in this paper is the granularity of data labeling, that is, the units of data with which purposes can be associated. We address this issue in the context of relational databases and propose four different labeling schemes, each providing a different granularity. In the paper we also propose an approach to representing purpose information, which results in very low storage overhead, and we exploit query modification techniques to support data access control based on purpose information. 1.
Supporting Multi%2DDimensional Trustworthiness for Grid Workflows.

DiXeminator A Profile%2DBased Selective Dissemination System for XML Documents.

A Flexible Access Control Model for Web Services.

Access to Multigranular Temporal Objects.

Towards Supporting Fine%2DGrained Access Control for Grid Resources.
The heterogeneous nature and independent administration of geographically dispersed resources in Grid, demand the need for access control using fine-grained policies. In this paper, we investigate the problem of fine-grained access control in the context of resource allocation in Grid, as we believe it is the first and key step in developing access control methods specifically tailored for Grid systems. To perform this access control, we design a security component (to be part of a meta-scheduler service) that finds the list of nodes where a user is authorized to run his/her jobs. The security component is designed in an effort to reduce the number of rules that need to be evaluated for each user request.
An authorization model for geographical maps.

Grid based methods for estimating spatial join selectivity.

XJoin Index Indexing XML Data for Efficient Handling of Branching Path Expressions.
Queries for XML documents usually specify selection
A Trust%2Dbased Context%2DAware Access Control Model for Web%2DServices.
A key challenge in Web services security is the design of effective access control schemes that can adequately meet the unique security challenges posed by the Web services paradigm. Despite the recent advances in Web based access control approaches applicable to Web services, there remain issues that impede the development of effective access control models for Web services environment. Amongst them are the lack of context-aware models for access control, and reliance on identity or capability-based access control schemes. In this paper, we motivate the design of an access control scheme that addresses these issues, and propose an extended, trust-enhanced version of our XML-based Role Based Access Control (X-RBAC) framework that incorporates context-based access control. We outline the configuration mechanism needed to apply our model to the Web services environment, and also describe the implementation architecture for the system. Keywords: XML, Role-Based Access Control, Trust Management, Web-Services 1.
A Trigger%2DBased Approach for Communication Personalization.

A Fine%2DGrained Access Control Model for Web Services.

Securing DBMS Characterizing and Detecting Query Floods.

An XML%2DBased Approach to Document Flow Verification.

A Framework for Data Mining Pattern Management.
Abstract. To represent and manage data mining patterns, several aspects have to be taken into account: (i) patterns are heterogeneous in nature; (ii) patterns can be extracted from raw data by using data mining tools (a-posteriori patterns) but also defined by the users and used for example to check how well they represent some input data source (a-priori patterns); (iii) since source data change frequently, issues concerning pattern validity and synchronization are very important; (iv) patterns have to be manipulated and queried according to specific languages. Several approaches have been proposed so far to deal with patterns, however all of them lack some of the previous characteristics. The aim of this paper is to present an overall framework to cope with all these features. 1
A Framework for Contractual Resource Sharing in Coalitions.
We develop a framework for specifying and reasoning about policies for sharing resources in coalitions, focussing here on a particular, common type of contract in which coalition members agree to make available some total amount of specified resource over a given time period. The main part of the framework is a policy language with two basic elements: ‘obligations ’ (of a member enterprise to provide a total amount of resource over a given time period) express the coalition policy, and ‘entitlements’ (granted by an enterprise to other coalition members) express the local policies of the coalition members. We discuss the conditions under which a local policy can be said to be in compliance with, or meet, the obligations of a coalition policy, and the conditions under which an obligation, and by extension a contract, can be said to be violated or fulfilled. 1
Towards a Language for Pattern Manipulation and Querying.
Patterns are concise, but rich in semantic, representation of  data. The approaches proposed in the literature to cope with pattern  management problems usually deal with a single type of knowledge artifact  and mainly concern pattern extraction issues. Little emphasis has  been posed in defining an overall environment to represent and e#ciently  manage di#erent types of patterns. The first general approach to deal  with patterns has been proposed in the context of the PANDA project  [1]. In this paper, we discuss some basic requirements for pattern manipulation  and retrieval, represented according to the PANDA model. The  proposed languages extend previous proposals and represent the basis  for the development of an e#cient pattern query processor.
Privacy%2DPreserving Trust Negotiations.

An Access Control System for a Web Map Management Service.
In this paper, we present an access control model for spatial data on Web. Such a model is based on the following assumptions: first, spatial data consist of objects with sharp boundaries located in a geographical space; second, data are manipulated through the operations provided by a Web Map Management Service. The goal of the system is to control the way data are accessed by users having different profiles. We propose an extension of classical models based on authorization rules by assigning authorizations a geographical scope. In such a way, the operations users may execute on spatial data may vary, depending on user identity and object position. 1.
Security for grid%2Dbased computing systems issues and challenges.

X%2DGTRBAC admin a decentralized administration model for enterprise wide access control.
The modern enterprise spans several functional units or administrative domains with diverse authorization requirements. Access control policies in an enterprise environment typically express these requirements as authorization constraints. While desirable for access control, constraints can lead to conflicts in the overall policy in a multidomain environment. The administration problem for enterprise-wide access control, therefore, not only includes authorization management for users and resources within a single domain but also conflict resolution among heterogeneous access control policies of multiple domains to allow secure interoperation within the enterprise. This work presents design and implementation of X-GTRBAC Admin, an administration model that aims at enabling administration of role-based access control (RBAC) policies in the presence of constraints with support for conflict resolution in a multidomain environment. A key feature of the model is that it allows decentralization of policy administration tasks through the abstraction of administrative domains, which not only simplifies authorization management, but is also fundamental to the concept of decentralized conflict resolution presented. The paper also illustrates the applicability of the outlined administrative concepts in a realistic enterprise environment using an implementation prototype that facilitates policy administration in large enterprises.
Exploiting User%2DProfiles for the Selective Dissemination of XML Documents.

Modeling and Language Support for the Management of Pattern%2DBases.
In our days knowledge extraction methods are able to produce artifacts (also called patterns) that concisely represent data. Patterns are usually quite heterogeneous and require ad-hoc processing techniques. So far, little emphasis has been posed on developing an overall integrated environment for uniformly representing and querying different types of patterns. Within the larger context of modelling, storing, and querying patterns, in this paper, we: (a) formally define the logical foundations for the global setting of pattern management through a model that covers data, patterns and their intermediate mappings; (b) present a pattern specification language for pattern management along with safety restrictions; and (c) introduce queries and query operators and identify interesting query classes.
Enhancing the expressive power of the U%2DDatalog language
U-Datalog has been developed with the aim of providing a set-oriented logical update language, guaranteeing update parallelism in the context of a Datalog-like language. In U-Datalog, updates are expressed by introducing constraints (+p(X), to denote insertion, and p(X), to denote deletion) inside Datalog rules. A U-Datalog program can be interpreted as a CLP program. In this framework, a set of updates (constraints) is satisable if it does not represent an inconsistent theory, that is, it does not require the insertion and the deletion of the same fact. This approach resembles a very simple form of negation. However, on the other hand, U-Datalog does not provide any mechanism to explicitly deal with negative information, resulting in a language with limited expressive power. In this paper, we provide a semantics, based on stratication, handling the use of negated atoms in U-Datalog programs and we show which problems arise in dening a compositional semantics.
Hsgs An Interactive System For High%2DLevel Specification And Generation Of Hypermedia Presentations.

XML%2DBased Specification for Web Services Document Security.

Guest Editors%27 Introduction Data Dissemination on the Web.

Access%2DControl Language for Multidomain Environments.
In this paper, we propose a role-based access control (RBAC) system for the distributed resources in a cyber-physical system. Current identity-based access control systems cause substantial administration overhead for the resource managers in the cyberphysical system because of the direct mapping between individual users and the access privileges on the resources. Our RBAC system uses Shibboleth, which is an attribute authorization service currently being used in Grids. The administration overhead is reduced in our system because the role privileges of individual users are managed by Shibboleth, not by the resource managers. For the uniform specification of access control policies across different security domains, we use the core and hierarchical RBAC profile of the eXtensible Access Control Markup Language (XACML); and for distributed administration of those policies, we used the Object, Metadata and Artifacts Registry (OMAR). OMAR is based on the e-business eXtensible Markup Language (ebXML) registry specifications developed to achieve interoperable registries and repositories. Our RBAC system provides scalable and fine-grain access control and allows privacy protection. Performance analysis shows that our system adds only a small overhead to the existing security infrastructures.
Selective and Authentic Third%2DParty Distribution of XML Documents.
Abstract—Third-party architectures for data publishing over the Internet today are receiving growing attention, due to their scalability properties and to the ability of efficiently managing large number of subjects and great amount of data. In a third-party architecture, there is a distinction between the Owner and the Publisher of information. The Owner is the producer of information, whereas Publishers are responsible for managing (a portion of) the Owner information and for answering subject queries. A relevant issue in this architecture is how the Owner can ensure a secure and selective publishing of its data, even if the data are managed by a third-party, which can prune some of the nodes of the original document on the basis of subject queries and access control policies. An approach can be that of requiring the Publisher to be trusted with regard to the considered security properties. However, the serious drawback of this solution is that large Web-based systems cannot be easily verified to be secure and can be easily penetrated. For these reasons, in this paper, we propose an alternative approach, based on the use of digital signature techniques, which does not require the Publisher to be trusted. The security properties we consider are authenticity and completeness of a query response, where completeness is intended with regard to the access control policies stated by the information Owner. In particular, we show that, by embedding in the query response one digital signature generated by the Owner and some hash values, a subject is able to locally verify the authenticity of a query response. Moreover, we present an approach that, for a wide range of queries, allows a subject to verify the completeness of query results. Index Terms—Secure publishing, third-party publication, XML, authentication, completeness. 1
Extending the ODMG Object Model with Triggers.

Association Rule Hiding.
Large repositories of data contain sensitive information that must be protected against unauthorized access. The protection of the confidentiality of this information has been a long-term goal for the database security research community and for the government statistical agencies. Recent advances in data mining and machine learning algorithms, have increased the disclosure risks that one may encounter when releasing data to outside parties. A key problem, and still not sufficiently investigated, is the need to balance the confidentiality of the disclosed data with the legitimate needs of the data users. Every disclosure limitation method affects, in some way, and modifies true data values and relationships. In this paper, we investigate confidentiality issues of a broad category of rules, the association rules. In particular, we present three strategies and five algorithms for hiding a group of association rules, which is characterized as sensitive. One rule is characterized as sensitive if its disclosure risk is above a certain privacy threshold. Sometimes, sensitive rules should not be disclosed to the public, since among other things, they may be used for inferring sensitive data, or they may provide business competitors with an advantage. We also perform an extensive validation and evaluation study of the hiding algorithms, in order to analyze their time complexity and the impact that they have in the original database. Index Terms- Privacy preserving data mining, association rule mining, sensitive rule hiding. 1
Trust%2DX A Peer%2Dto%2DPeer Framework for Trust Establishment.
Abstract—In this paper, we present Trust-X, a comprehensive XML-based [12] framework for trust negotiations, specifically conceived for a peer-to-peer environment. Trust negotiation is a promising approach for establishing trust in open systems like the Internet, where sensitive interactions may often occur between entities at first contact, with no prior knowledge of each other. The framework we propose takes into account all aspects related to negotiations, from the specification of the profiles and policies of the involved parties to the selection of the best strategy to succeed in the negotiation. Trust-X presents a number of innovative features, such as the support for protection of sensitive policies, the use of trust tickets to speed up the negotiation, and the support of different strategies to carry on a negotiation. In this paper, besides presenting the language to encode security information, we present the system architecture and algorithms according to which negotiations can take place. Index Terms—Security and protection, access controls, and trust negotiation. æ 1
A matching algorithm for measuring the structural similarity between an XML document and a DTD and its applications.

Merkle Tree Authentication in UDDI Registries.
UDDI registries are today the standard way of publishing information on web services. They can be thought of as a structured repository of information that can be queried by clients to find the web services that better fit they needs. Even if, at the beginning, UDDI has been mainly conceived as a public registry without specific facilities for security, today security issues are becoming more and more crucial, due to the fact that data published in UDDI registries may be highly strategic and sensitive. In this paper, we focus on authenticity issues, by proposing a method, based on Merkle Hash Trees, which does not require the party managing the UDDI to be trusted wrt authenticity. In the paper, besides giving all the details of the proposed solution, we show its benefit wrt standard digital signature techniques.
Hsgs An Interactive System For High%2DLevel Specification And Generation Of Hypermedia Presentations.

Handling Expiration of Multigranular Temporal Objects.
A well-known problem of temporal databases is that the amount of stored data tends to increase very fast. Moreover, detailed  data are useful when they are acquired but they often become less relevant after some time. In most cases, after a period of  time only summarized data need to be kept, whereas detailed data expire and can be removed from the database. Multigranular  temporal databases enhance the expressive power of temporal databases by supporting temporal attributes at different levels  of detail. However, in existing approaches the level of detail of an attribute, that is its granularity, depends only on the  attribute semantics and does not depend on how recent the attribute values are. This paper proposes an approach supporting  the aggregation of different portions of the value of a temporal attribute at different levels of detail, and the deletion or the  transfer to tertiary storage of old values at a given level of detail, in order to minimize disk storage occupancy. In the proposed  multigranular temporal object-oriented data model, the expiration of attribute values at a given granularity can be specified,  together with the action to take when data expire: either aggregation to a coarser granularity, or deletion of values, or both. Keywords: Temporal databases, multiple granularities, granularity evolution, deletion of temporal values, expiration of dynamic  attributes.
A Logical Approach to Quality of Service Specification in Video Databases.
Quality of Service (QoS) is defined as a set of perceivable attributes expressed in a user-friendly language with parameters that may be objective or subjective. Objective parameters are those related to a particular service and are measurable and verifiable. Subjective parameters are those based on the opinions of the end-users. We believe that quality of service should become an integral part of multimedia database systems and users should be able to query by requiring a quality of service from the system. The specification and enforcement of QoS presents an interesting challenge in multimedia systems development. A deal of effort has been done on QoS specification and control at the system and the network levels, but less work has been done at the application/user level. In this paper, we propose a language, in the style of constraint database languages, for formal specification of QoS constraints. The satisfaction by the system of the user quality requirements can be viewed as a constraint satisfaction problem, and the negotiation can be viewed as constraint optimization. We believe this paper represents a first step towards the development of a database framework for quality of service management in video databases. The contribution of this paper lies in providing a logical framework for specifying and enforcing quality of service in video databases. To our knowledge, this work is the first from a database perspective on quality of service management.
State%2Dof%2Dthe%2Dart in privacy preserving data mining.
We provide here an overview of the new and rapidly emerging research area of privacy preserving data mining. We also propose a classification hierarchy that sets the basis for analyzing the work which has been performed in this context. A detailed review of the work accomplished in this area is also given, along with the coordinates of each work to the classification hierarchy. A brief evaluation is performed, and some initial conclusions are made.
CiVeDi A Customized Virtual Environment for Database Interaction.

Guest Editors%27 Introduction.

User Preferences VS Minimality in PPDL.
PDL. Proc. of NRAC03. In press.
Local Closed%2DWorld Assumptions for reasoning about Semantic Web data.
Abstract The Semantic Web (SW) can be seen as abstract representation and exchange of data and metadata. Metadata is given in terms of data mark-up and reference to shared, Web-accessible ontologies. Several interesting languages are now available for the Semantic Web. They exploit XML allowing data/metadata communication, yet are endowed with a logical semantics. Such languages allow compact descriptions by means of inheritance mechanisms that permit one to describe an object as belonging to one or more classes whose hierarchy is already described on the Web. With few exceptions, SW logical languages are designed to be monotonic, thus they cannot employ the closed-world assumption i) to make object description compact and most importantly ii) to prevent large ontologies from admitting inconsistency resulting from multiple inheritance. We address these problems by proposing a version of Local Closed-World Assumption that fits SW purposes. Its extent is itself the subject of negotiation between communicating agents. In this light, we give a new default semantics to RDF type inheritance primitives and show that Answer Set Programming seems a promising tool for the automation of consistency maintenance over Semantic Web annotations. 1
Trust%2DChi An XML Framework for Trust Negotiations.

PC Co%2Dchairs%27 Message.

A Decentralized Approach for Controlled Sharing of Resources in Virtual Communities.

Supporting Delegation in Secure Workflow Management Systems.

Author%2DChi %2D A System for Secure Dissemination and Update of XML Documents.

Towards a Logical Model for Patterns.

Signature and Access Control Policies for XML Documents.

An abstraction%2Dbased approach to measuring the structural similarity between two unordered XML documents.

A reference framework for integrating multiple representations of geographical maps.

A multigranular spatiotemporal data model.

A Flexible Authentication Method for UDDI Registries.

Access Control in Dynamic XML%2DBased Web%2DServices with X%2DRBAC.
Policy specification for securing Web services is fast emerging as a key research area due to rapid proliferation of Web services in modern day enterprise applications. Whilst the use of XML technology to support these Web services has resulted in their tremendous growth, it has also introduced a new set of security challenges specific to these Web services. Though there has been recent research in areas of XML-based document security, these challenges have not been addressed within the XML framework. In this paper, we present X-RBAC, an XML-based RBAC policy specification framework for enforcing access control in dynamic XML-based Web services. An X-RBAC system has been implemented as a Java application, and is based on a specification language that addresses specific security requirements of these Web services. We discuss the salient features of the specification language, and present the software architecture of our X-RBAC system.
An abstraction%2Dbased approach to measuring the structural similarity between two unordered XML documents.

PDL with Maximum Consistency Monitors.

X%2DTNL An XML%2Dbased Language for Trust Negotiations.

An infrastructure for managing secure update operations on XML data.

Dependencies and separation of duty constraints in GTRBAC.
A Generalized Temporal Role Based Access Control (GTRBAC) model that captures an exhaustive set of temporal constraint needs for access control has recently been proposed. GTRBAC&#039;s language constructs allow one to specify various temporal constraints on role, user-role assignments and role-permission assignments. In this paper, we identify various time-constrained cardinality, control flow dependency and separation of duty constraints (SoDs). Such constraints allow specification of dynamically changing access control requirements that are typical in today&#039;s large systems. In addition to allowing specification of time, the constraints introduced here also allow expressing access control policies at a finer granularity. The inclusion of control flow dependency constraints allows defining much stricter dependency requirements that are typical in workflow types of applications.
Memorizzazione di regole per l%27instradamento di messaggi in un sistema di comunicazione universale.

PAtterns for Next%2Dgeneration DAtabase systems preliminary results of the PANDA project.
Abstract. Nowadays, the vast volume of collected digital data obliges us to employ processing methods like pattern recognition and data mining in order to reduce the complexity of data management. The output of these techniques are knowledge artifacts, heterogeneous in both structure and semantics. We claim that the concept of pattern is a good candidate for generic representation of these novel information types. The PANDA project is aimed at studying the main issues related to pattern handling. In this paper we present the preliminary results obtained: we outline the architecture of Pattern-Base Management Systems, we provide the foundations of the logical framework, and we present the preliminary issues related to processing queries on patterns. 1 Introduction and
Grid Based Methods for the Spatial Join Estimation.

ViRdB integrating virtual reality and multimedia databases for customized visualization of cultural heritage.

A hierarchical access control model for video database systems.
... In this paper, we propose a novel approach to support multilevel access control in video databases. Our access control technique combines a video database indexing mechanism with a hierarchical organization of visual concepts (i.e., video database indexing units), so that different classes of users can access different video elements or even the same video element with different quality levels according to their permissions. These video elements, which, in our access control mechanism, are used for specifying the authorization objects, can be a semantic cluster, a subcluster, a video scene, a video shot, a video frame, or even a salient object (i.e., region of interest). In the paper, we first introduce our techniques for obtaining these multilevel 
A logical framework for reasoning about access control models.
The increased awareness of the importance of data protection has made access control a relevant component of current data management systems. Moreover, emerging applications and data models call for flexible and expressive access control models. This has led to an extensive research activity that has resulted in the definition of a variety of access control models that differ greatly with respect to the access control policies they support. Thus, the need arises for developing tools for reasoning about the characteristics of these models. These tools should support users in the tasks of model specification, analysis of model properties, and authorization management. For example, they must be able to identify inconsistencies in the model specification and must support the administrator in comparing the expressive power of different models. In this paper, we make a first step in this direction by proposing a formal framework for reasoning about access control models. The framework we propose is based on a logical formalism and is general enough to model discretionary, mandatory, and role-based access control models. Each instance of the proposed framework corresponds to a C-Datalog program, interpreted according to a stable model semantics. In the paper, besides giving the syntax and the formal semantics of our framework, we show some examples of its application. Additionally, we present a number of dimensions along which access control models can be analyzed and compared. For each dimension, we show decidability results and we present some examples of its application.
RBAC models %2D concepts and trends.

A set%2Doriented method definition language for object databases and its semantics.

Quality of Service Specification in Video Databases.
Quality of Service (QoS) is defined as a set of perceivable attributes expressed in a  user-friendly language with parameters that may be subjective or objective. Objective  parameters are those related to a particular service and are measurable and verifiable. Subjective
Hierarchical data placement for navigational multimedia applications.
Navigat1/ has added intx&#039;&amp;M1q it in nowadaysmult imedia applicatpli whichsupport e#ectxx accessingt oobject s of various format and presen tesen requir ement1 Stnt1 issues needt be reconsidered for tr new tw1 ofnavigatq)/` mult(&amp;/x` applic in order t improvesyst m&#039;s performance. This paper addresses t1 problem ofmultM&amp; dia dat st))D t))D improving da access ibilit and request servicing undernavigat ional applicatplic Anavigat)x&#039; l graph-based model (forto mult imedia da t representes1M ) is proposedt guideti dat placement under a hierarchicalstl1fi/ tl1fi/` . The multul - iadat dependencies, access frequencies andt)M&#039;D const aint are usedt charact&amp;1q) tr graph nodes which correspondt mult(` dia obj ect allocato at t to iary sty1 ge level. Based oncertfifi defined popularit critri a,dat areelevat ed and placed on secondary leveltvel1fi improvingbot tt request servicing and dat accessibilit y. The proposedmult imediadat elevat ion is aprefet1 ing approach sinceit is performed &#034;apriori&#034;(not on demand) based on previously extusly1 user accesspats rns. Appropriat dat placement policies are also employedat t secondary level, and a simulat(D model has been developed based on current commercialtommer y and secondaryston ge devices. This model is usedt evaluat et/ proposed popularit based da televat&#039;1 approach as employed under a hierarchical stcal1 subsyst em. Experimenti ion is performed underartr1)`M dat workloads andit is showntow to proposed hierarchical da t placement approach considerably improves dat accessing and request servicing in navigati  nal mult/) dia applic atlic1 Theit1)&#039;DM( improvement placement is provent out erform earlier relati mult imediadat placement policieswit respect t commonly used performancemet ics.
Quality of Service Specification in Video Databases.
Quality of Service (QoS) is defined as a set of perceivable attributes expressed in a  user-friendly language with parameters that may be subjective or objective. Objective  parameters are those related to a particular service and are measurable and verifiable. Subjective
Static Analysis of Logical Languages with Deferred Update Semantics.

Refined rules termination analysis through transactions.

T%2DODMG an ODMG compliant temporal object model supporting multiple granularity management.

Content%2Dbased filtering of Web documents the MaX system and the EUFORBIA project.

Ordering and Path Constraints over Semistructured Data.

Trustworthy objects.
Personal use of the material in this paper is permitted. However, permission to reprint or republish this material for advertising or promotional purposes or for creating new works for resale or redistribution, or to reuse any copyrighted component of this work in other works must be obtained from the authors of this paper. This paper has appeared in special issue on Real-Time Systems.
A Database Approach to Quality of Service Specification in Video Databases.

Introducing Dynamic Behavior in Amalgamated Knowledge Bases.

3rd International Conference on Web Information Systems Engineering %28WISE 2002%29


Advances in Database Technology %2D EDBT 2002

A temporal key management scheme for secure broadcasting of XML documents.

Ma X  An Access Control System for Digital Libraries and the Web.

Hybrid Role Hierarchy for Generalized Temporal Role Based Access Control Model.
Generalized Temporal Role Based Access Control (GTRBAC) model that captures an exhaustive set of temporal constraint needs for access control has recently been proposed. GTRBAC&#039;s language constructs allow one to specify various temporal constraints on role, user-role assignments and role-permission assignments. In this paper, we present the notion of different types of role hierarchies based on the permission-inheritance and role activation semantics. In particular, we look at how new hierarchical relations between a pair of roles that are not directly related can be derived through other well-defined hierarchically related roles. When the different hierarchy types coexist in a role hierarchy, inferring such derived hierarchical relations between a pair of roles can be complex. The results presented here provides a basis for formally analyzing the derived inheritance and activation semantics between every pairs of roles in a hierarchy.
Distributed Cooperative Updates of XML Documents.
corresponding author Protection and secure exchange of Web documents is becoming a crucial need for many internetbased applications. Securing Web documents entail addressing two main issues: confidentiality and integrity. Ensuring document confidentiality means that document contents can only be disclosed to subjects authorized according to specified security policies, whereas by document integrity we mean that the document contents are correct with respect to a given application domain and that the document contents are modified only by authorized subjects. Whereas the problem of document confidentiality has been widely investigated in the literature, the problem of how to ensure that a document, when moving among different parties, is modified only according to the stated policies still lacks comprehensive solutions. In this paper we present a solution to this problem by proposing a model for specifying update policies, and an infrastructure supporting the specification and enforcement of these policies in a distributed and cooperative environment, in which subjects in different organizational roles can modify possibly different portions of the same document. The key aspect of our proposal is that, by using a combination of hash functions and digital signature techniques,
An Access Control System for Digital Libraries and the Web The MaX Prototype Demonstration.

Evolving a Set of DTDs According to a Dynamic Set of XML Documents.

Rules Termination Analysis investigating the interaction between transactions and triggers.

Matching an XML Document against a Set of DTDs.


A System to Specify and Manage Multipolicy Access Control Models.

Making access control more usable.
The usability of access control mechanisms in modern distributed systems has been widely criticized but little studied. In this paper, we carefully examine one such widely deployed access control mechanism, the one embedded in the WebDAV standard, from the point-of-view of an end-user trying to decide how to grant or deny access to some resource to a third party. This analysis points to problems with the conceptual usability of the system. Significant effort is required on the part of the user to determine how to implement the desired access rules; the user, however, has low interest and expertise in this task, given that such access management actions are almost always secondary to the collaborative task at hand. The analysis does however indicate a possible solution: to recast the access control puzzle as a decision support problem in which user intentions (i.e. the descriptions of desired system outputs) are interpreted by an access mediator that either automatically or semi-automatically decides how to achieve the designated goals and provides enough feedback to the user. We call such systems intentional access management (IAM) systems and describe them in both specific and general terms. To demonstrate the feasibility and usability of the proposed IAM models, we develop an intentional access management prototype for WebDAV. The results of a user study conducted on the system show its superior usability compared to traditional access management tools like the access control list editor. Categories and Subject Descriptors D.4.6 [Operating Systems]: Security and Protection – access controls. H.1.2 [Models and Principles]: User/Machine Systems
Temporal hierarchies and inheritance semantics for GTRBAC.

Evolution Specification of Multigranular Temporal Objects.

Secure and selective dissemination of XML documents.
XML (eXtensible Markup Language) has emerged as a prevalent standard for document representation and exchange on the Web. It is often the case that XML documents contain information of different sensitivity degrees that must be selectively shared by (possibly large) user communities. There is thus the need for models and mechanisms enabling the specification and enforcement of access control policies for XML documents. Mechanisms are also required enabling a secure and selective dissemination of documents to users, according to the authorizations that these users have. In this article, we make several contributions to the problem of secure and selective dissemination of XML documents. First, we define a formal model of access control policies for XML documents. Policies that can be defined in our model take into account both user profiles, and document contents and structures. We also propose an approach, based on an extension of the CryptolopeTM approach [Gladney and Lotspiech 1997], which essentially allows one to send the same document to all users, and yet to enforce the stated access control policies. Our approach consists of encrypting different portions of the same document according to different encryption keys, and selectively distributing these keys to the various users according to the access control policies. We show that the number of encryption keys that have to be generated under our approach is minimal and we present an
Introducing Dynamic Behavior in Amalgamated Knowledge Bases

Using spatial data access structures for filtering nearest neighbor queries.

Protection and administration of XML data sources.
EXtensible Markup Language (XML) security has become a relevant research topic due to the widespread use of XML as the language for information interchange and document definition over the Web. In this context, developing an access control mechanism in terms of XML is an important step for Web information security. In this paper, we present the protection and administration facilities of Author-X, a Java-based system for discretionary access control to XML documents. Relevant features of Author-X are both a set-oriented and a document-oriented credential-based document protection, a differentiated protection of document/document type contents through the support of multi-granularity protection objects and positive/negative authorizations, and the support for different access control strategies. In this paper, we focus on the strategies we have developed for enforcing access control. Additionally, we provide a description of the environment we have developed to help the Security Officer in performing administrative
Workflow Architecture for Interactive Video Management Systems.

IEEE Internet Computing Guest Editors%27 Introduction %2D Database Technology on the Web.

Guest Editors%27 Introduction Database Technology on the Web.

A Content%2DBased Authorization Model for Digital Libraries.
AbstractÐDigital Libraries (DLs) introduce several challenging requirements with respect to the formulation, specification, and enforcement of adequate data protection policies. Unlike conventional database environments, a DL environment typically is characterized by dynamic user population, often making accesses from remote locations, and by an extraordinarily large amount of multimedia information, stored in a variety of formats. Moreover, in a DL environment, access policies are often specified based on user qualifications and characteristics, rather than user identity (for example, a user can be given access to an R-rated video only if he/ she is older than 18 years). Another crucial requirement is the support for content-dependent authorizations on digital library objects (for example, all documents containing discussions on how to operate guns must be made available only to users who are 18 or older). Since traditional authorization models do not adequatly meet access control requirements typical to DLs, in this paper, we propose a content-based authorization model suitable for a DL environment. Specifically, the most innovative features of our authorization model are: 1) flexible specification of authorizations based on the qualifications and characteristics of users (including positive and negative), 2) both content-dependent and content-independent access control to digital library objects, and 3) varying granularity of authorization objects ranging from sets of library objects to specific portions of objects. Index TermsÐDigital libraries, access control, authorization. 1
An authorization system for digital libraries.
Hypermedia concepts are currently being deployed in a variety of information systems such as the World Wide Web, software development environments, large engineering enterprises, collaborative authoring systems, and digital library systems. The complex requirements of these application areas have resulted in extensive research into hypermedia infrastructures. The HyperDisco project is about design, development, deployment and assessment of hypermedia infrastructures. Previous HyperDisco experiments have dealt with integration of a small set of tools supporting authoring and extension of the integrated tools to support multiple collaborating users and multiple versions of shared files. These experiments were conducted on a local area network using a single centralized workspace. The latest version of HyperDisco supports collaboration and versioning over multiple workspaces distributed across the Internet. This paper gives a brief overview of HyperDisco, describes the workspace concept and reports on the latest experiments: (1) an experiment that allows the use of multiple workspaces on a local area network, (2) an experiment that allows workspaces to be distributed across the Internet, and (3) an experiment focusing on hypermedia modeling and presentation issues of distributed workspaces.
A Knowledge%2DBased Approach to Visual Information.

An authorization system for digital libraries.
Hypermedia concepts are currently being deployed in a variety of information systems such as the World Wide Web, software development environments, large engineering enterprises, collaborative authoring systems, and digital library systems. The complex requirements of these application areas have resulted in extensive research into hypermedia infrastructures. The HyperDisco project is about design, development, deployment and assessment of hypermedia infrastructures. Previous HyperDisco experiments have dealt with integration of a small set of tools supporting authoring and extension of the integrated tools to support multiple collaborating users and multiple versions of shared files. These experiments were conducted on a local area network using a single centralized workspace. The latest version of HyperDisco supports collaboration and versioning over multiple workspaces distributed across the Internet. This paper gives a brief overview of HyperDisco, describes the workspace concept and reports on the latest experiments: (1) an experiment that allows the use of multiple workspaces on a local area network, (2) an experiment that allows workspaces to be distributed across the Internet, and (3) an experiment focusing on hypermedia modeling and presentation issues of distributed workspaces.
Intelligent Database Systems

Introducing Cooperation and Actions in Amalgamated Knowledge Bases.

A Secure Publishing Service for Digital Libraries of XML Documents.

Hiding Association Rules by Using Confidence and Support.
Large repositories of data contain sensitive information which must be protected against unauthorized access. The protection of the confidentiality of this information has been a long-term goal for the database security research community and the government statistical agencies. Recent advances, in data mining and machine learning algorithms, have increased the disclosure risks one may encounter when releasing data to outside parties.
An Access Control Mechanism for Large Scale Data Dissemination Systems.

A logical framework for reasoning about access control models.
The increased awareness of the importance of data protection has made access control a relevant component of current data management systems. Moreover, emerging applications and data models call for flexible and expressive access control models. This has led to an extensive research activity that has resulted in the definition of a variety of access control models that differ greatly with respect to the access control policies they support. Thus, the need arises for developing tools for reasoning about the characteristics of these models. These tools should support users in the tasks of model specification, analysis of model properties, and authorization management. For example, they must be able to identify inconsistencies in the model specification and must support the administrator in comparing the expressive power of different models. In this paper, we make a first step in this direction by proposing a formal framework for reasoning about access control models. The framework we propose is based on a logical formalism and is general enough to model discretionary, mandatory, and role-based access control models. Each instance of the proposed framework corresponds to a C-Datalog program, interpreted according to a stable model semantics. In the paper, besides giving the syntax and the formal semantics of our framework, we show some examples of its application. Additionally, we present a number of dimensions along which access control models can be analyzed and compared. For each dimension, we show decidability results and we present some examples of its application.
Panel The next generation of acess control models %28panel session%29 do we need them and what should they be%3F

On specifying security policies for web documents with an XML%2Dbased language.
The rapid growth of the Web and the ease with which data can be accessed facilitate the distribution and sharing of information. Information dissemination often takes the form of documents that are made available at Web servers, or that are actively broadcasted byWeb servers to interested clients. In this paper, we present an XML-compliant formalism for specifying security-related information for Web document protection. In particular, we introduce X -Sec, an XML-based language for specifying subject credentials and security policies and for organizing them into subject profiles and policy bases, respectively. The language is complemented by a set of subscription-based schemes for accessing distributed Web documents, which rely on defined XML subject profiles and XML policy bases.
Securing XML Documents the Author%2DX Project Demonstration.

Navigating Through Multiple Temporal Granularity Objects.
Managing and relating temporal information at different time units is an important issue in many applications and research areas, among them temporal object-oriented databases. Due to the semantic richness of the objectoriented data model, the introduction of multiple temporal granularities in such a model poses several interesting issues. In particular, object-oriented query languages provide a navigational approach to data access, performed via path expressions. In this paper we present an extension to path expressions to a multi-granularity context. The syntax and semantics of the proposed path expressions are formally defined.
A Linguistic Framework for Querying Dimensional Data.
This paper deals with dimensional data. Examples of dimensions are space and time. Thus, temporal, spatial, spatiotemporal values are examples of dimensional data. We define the notion of dimensional object, extending an object-oriented ODMG-like type system to include dimensional types. We then address the problem of querying dimensional objects. Linguistic constructs are introduced that allow objects with different dimensions to be mixed in the same phrases. This allows the user to formulate both associative and navigational accesses seamlessly without having to worry about the dimensions of the various data elements involved.  1 
Directions for Web and E%2DCommerce Applications Security.
urtinsubria. it This paper provides directions for web and e-commerce applications security. In particular, access contra1 policies, workflow security, XML security arid federated database security issues pertaining to the web and e-commerce applications are discussed. 1.
TRBAC A temporal role%2Dbased access control model.
A temporal RBAC (TRBAC) model has recently been proposed that addresses the temporal aspects of roles and trigger-based role enabling. However, it is limited to constraints on enabling of roles only. We propose a Generalized Temporal Role Based Access Control model (GTRBAC) that is capable of expressing a wider range of temporal constraints. GTRBAC is capable of expressing periodic as well as duration constraints on roles, user-role assignments and role-permission assignments. In GTRBAC, temporal constraints on role enablings and role activations can be separately specified. A user-activated role can further be restricted to various activation constraints such as cardinality constraint or maximum active duration constraint within a specified interval. The GTRBAC model extends the synta ctic structure of TRBAC model and its event and trigger expressions subsume those of TRBAC. Portions of this work were supported by the sponsors of the Center for Education and Role based access control (RBAC) models have generated great interest in the security community as a powerful and generalized approach to security [2, 13, 16, 18, 19]. In RBAC,
A nested transaction model for multilevel secure database management systems.

Metadata
This document is a revision of the public working draft dated 1998-08-19 incorporating suggestions received in review comments and further deliberations of the W3C RDF Model and Syntax Working Group. With the publication of this draft, the RDF Model and Syntax Specification enters &#034;last call.&#034; The last call period will end on October 23, 1998. Comments on this specification may be sent to www-rdf-comments@w3.org. The archive of public comments is available at http://www.w3.org/Archives/Public/www-rdf-comments. Significant changes from the previous draft are highlighted in Appendix E. While we do not anticipate substantial changes, we still caution that further changes are possible. Therefore while we encourage active implementation to test this specification we also recommend that only software that can be easily field-upgraded be implemented to this specification at this time. This is a W3C Working Draft for review by W3C members and other interested parties. Publication as a working draft does not imply endorsement by the W3C membership. The RDF Model and Syntax  Working Group will not allow early implementation to constrain their ability to make changes to this specification prior to final release. This is a draft document and may be updated, replaced or obsoleted by other documents at any time. It is inappropriate to cite W3C Working Drafts as other than &#034;work in progress&#034;. This work is part of the W3C Metadata Activity.
Securing XML Documents with Author%2DX.
Access control techniques for XML provide a simple way to protect confidential information at the same granularity level provided by XML schemata. The widespread adoption of the eXtensible Markup Language has profoundly changed the nature of the information and user interaction styles available on the Web. Unlike HTML, XML can represent both document structure and content, offering increased control of information granularity through transformation and query languages. The original XML 1.0 specification used Document Type Definitions (DTDs) to describe document structure; recently, the World
Integrating XML and Databases.
Query processing of integrated XML databases has recently received considerable attention. It helps users to extract information from an integrated XML databases system. A flexible and efficient framework for such query processing is proposed. Through a single request, without concern about their internal structures and geographical distribution, it allows decomposition of global queries into sub-queries conformed simultaneously to local formats. In order to reduce the redundancies of mappings, low-level metadata processing has been introduced; it yields bidirectional mappings for query decomposition and data conversion from the original metadata. It is also shown how to extract data and resolve conflicts between them to provide user-friendly results. XML Declarative Description [15] is applied to all components of the framework as their underlying model. 1.
XML and Data Integration.
Abstract. Data integration is the problem of combining data residing at different sources, and providing the user with a virtual view, called global schema, independent from the sources. Our goal is to address some of the issues related to XML data integration. In particular, we highlight two major issues that emerge in this context: (i) the global schema may be characterized by a set of constraints, expressed by a DTD and XML integrity constraints, (ii) the concept of node identity requires to introduce semantic criteria to identify nodes coming from different sources. We propose a formal framework for XML data integration systems based on an expressive global schema, a set of XML data sources and a set of mappings specified by means of a simple tree language. Then, we define an identification function that aims at globally identifying nodes coming from different sources. Finally, we address query answering and propose algorithms to answer queries under different assumptions for the mappings. 1
Correction to %27MPGS An Interactive Tool for the Specification and Generation of Multimedia Presentations%27.

Quality of Service in Multimedia Digital Libraries.

Enhancing the expressive power of the U%2DDatalog language.
U-Datalog has been developed with the aim of providing a set-oriented logical update language, guaranteeing update parallelism in the context of a Datalog-like language. In U-Datalog, updates are expressed by introducing constraints (+p(X), to denote insertion, and p(X), to denote deletion) inside Datalog rules. A U-Datalog program can be interpreted as a CLP program. In this framework, a set of updates (constraints) is satisable if it does not represent an inconsistent theory, that is, it does not require the insertion and the deletion of the same fact. This approach resembles a very simple form of negation. However, on the other hand, U-Datalog does not provide any mechanism to explicitly deal with negative information, resulting in a language with limited expressive power. In this paper, we provide a semantics, based on stratication, handling the use of negated atoms in U-Datalog programs and we show which problems arise in dening a compositional semantics.
ECOOP 2000 %2D Object%2DOriented Programming

TRBAC a temporal role%2Dbased access control model.
A temporal RBAC (TRBAC) model has recently been proposed that addresses the temporal aspects of roles and trigger-based role enabling. However, it is limited to constraints on enabling of roles only. We propose a Generalized Temporal Role Based Access Control model (GTRBAC) that is capable of expressing a wider range of temporal constraints. GTRBAC is capable of expressing periodic as well as duration constraints on roles, user-role assignments and role-permission assignments. In GTRBAC, temporal constraints on role enablings and role activations can be separately specified. A user-activated role can further be restricted to various activation constraints such as cardinality constraint or maximum active duration constraint within a specified interval. The GTRBAC model extends the synta ctic structure of TRBAC model and its event and trigger expressions subsume those of TRBAC. Portions of this work were supported by the sponsors of the Center for Education and Role based access control (RBAC) models have generated great interest in the security community as a powerful and generalized approach to security [2, 13, 16, 18, 19]. In RBAC,
Exception Handling in Object%2DOriented Databases.

An Access Control Model for Video Database Systems.
... In this paper, we propose a novel approach to support multilevel access control in video databases. Our access control technique combines a video database indexing mechanism with a hierarchical organization of visual concepts (i.e., video database indexing units), so that different classes of users can access different video elements or even the same video element with different quality levels according to their permissions. These video elements, which, in our access control mechanism, are used for specifying the authorization objects, can be a semantic cluster, a subcluster, a video scene, a video shot, a video frame, or even a salient object (i.e., region of interest). In the paper, we first introduce our techniques for obtaining these multilevel 
Protecting XML Documents Position Paper.

Author%2DX A Java%2DBased System for XML Data Protection.
XML (eXtensible Markup Language) has recently emerged as the most relevant standardization effort in the area of markup languages, and it is increasingly used as the language for information exchange over Web. In this context, developing an access control mechanism in terms of XML is an important step for Web information security. In this paper, we present Author-X , a Java-based system for access control to XML documents. Author-X implements a discretionary access control model specifically tailored to the characteristics of XML documents. In particular, Author-X allows (i) a set-oriented and document-oriented protection, by supporting authorizations both at documenttype level and documentlevel; (ii) a differentiated protection of document/document type contents by supporting multigranularity protection objects and positive/negative authorizations; (iii) a controlled propagation of authorizations among protection objects, by enforcing multiple propagation options. The overall architecture of Author-X is described. Implementation issues and choices of Author-X are discussed, with respect to the XML authorization base and access control. A practical application of Author-X to the protection of a real XML source is provided.
Fuzzy and Presentation Algebras for Web and Multimedia Data.

Repository Management in an Intelligent Indexing Approach for Multimedia Digital Libraries.

Querying Multiple Temporal Granularity Data.
Managing and querying information with varying temporal granularities is an important problem in databases. Although there is a substantial body of work on temporal granularities for the relational data model [11], a comprehensive framework is lacking for the object-oriented paradigm. To the best of our knowledge, a formal treatment of temporal queries with multiple granularities has not been considered in the literature. In this paper we make a step in this direction. We formally introduce the syntax and semantics of expressions involving data with multiple granularities, comparison between data with different granularities, and conversion of data from one granularity to another. We believe that this is an important step towards the development of an object-oriented query language that supports multiple granularities.  Keywords: temporal granularities, temporal object databases, temporal object query languages.  1. 
Review %2D Data Mining An Overview from a Database Perspective.

Review %2D Role Hierarchies and Constraints for Lattice%2DBased Access Controls.

Review %2D Safeguarding Digital Library Contents and Users Protecting Documents Rather Than Channels.

Review %2D Supporting Valid%2DTime Indeterminacy.

Protecting information on the Web.
An attribute is a particular property of an entity, such as a role, access identity, group, or clearance. If attributes are provided integrity, authentication, and confidentiality, Web servers can then trust these secure attributes and use them for many purposes, such as access control, authorization, authentication, and electronic transactions. In this paper, we present a comprehensive approach to secure attribute services on the Web. We identify the user-pull and server-pull models and analyze their advantages and disadvantages. To support these models on the Web, we extend X.509 certificates, which are already in widespread current use. We name these extended X.509 certificates smart certificates. Smart certificates have several sophisticated features: they support short-lived lifetime and multiple CAs, contain attributes, provide postdated and renewable certificates, and provide confidentiality. This paper also discusses possible applications of smart certificates on the Web...
Flexible Transaction Dependencies in Database Systems.

Guest Editorial Introduction to the Special Section.
Abstract—M-Health can be defined as “mobile computing, medical sensor, and communications technologies for health-care.”
MPGS An Interactive Tool for the Specification and Generation of Multimedia Presentations.

Guest Editorial Introduction to the Special Section.
Abstract—M-Health can be defined as “mobile computing, medical sensor, and communications technologies for health-care.”
Trigger Inheritance and Overriding in an Active Object Database System.
An active database is a database in which some operations are automatically executed when specified events happen and particular conditions are met. Several systems supporting active rules in an object-oriented data model have been proposed. However, several issues related to the integration of triggers with object-oriented modeling concepts have not been satisfactorily addressed. In this paper, we discuss issues related to trigger inheritance and refinement in the context of the Chimera active object-oriented data model. In particular, we introduce a semantics for an active object language that takes into account trigger inheritance and supports trigger overriding. Moreover, we state conditions on trigger overriding ensuring that trigger semantics is preserved in subclasses.
ASEP A Secure and Flexible Commit Protocol for MLS Distributed Database Systems.
The classical Early Prepare commit protocol (EP), used in many commercial systems, is  not suitable for use in multilevel secure distributed databases systems that employ a locking  protocol for concurrency control. This is because EP requires that read locks are not released  by a participant during its window of uncertainty; however, it is not possible for a locking  protocol to provide this guarantee in a multilevel secure system (since the read lock of a higher  level transaction on a lower level data object must be released whenever a lower level transaction  wants to write the same data). The only available work in the literature, namely the Secure Early  Prepare protocol (SEP), overcomes this difficulty by aborting those distributed transactions that  release their low level read locks prematurely. We see this approach as being too restrictive.
A Logical Approach to Cooperative Information Systems.
&#034;Cooperative information system management&#034; refers to the capacity of several computing systems to communicate and cooperate in order to acquire, store, manage, query data and knowledge. Current solutions to the problem of cooperative information management are still far from being satisfactory. In particular, they lack the ability to fully model cooperation among heterogeneous systems according to a declarative style. The use of a logical approach to model all aspects of cooperation seems very promising. In this paper, we de ne a logical language able to support cooperative queries, updates and update propagation. We model the sources of information as deductive databases, sharing the same logical language to express queries and updates, but containing independent, even if possibly related, data. We use the Obj-U-Datalog [5] language to model queries and transactions in each source of data. Such language is then extended to deal with active rules in the style of Active-U-Datalog [4,2...
A Semantic%2DBased Execution Model for Multilevel Secure Workflows.
Workflow management systems (WFMS) support the modeling and coordinated execution of processes within an organization. To coordinate the execution of the various activities (or tasks) in a workflow, task dependencies are specified among them. As advances in workflow management take place, they are also required to support security. In a multilevel secure (MLS) workflow, tasks may belong to di#erent security levels. Ensuring the dependencies from the tasks at higher security levels to those at lower security levels (high-to-low dependencies) may compromise security. In this paper, we consider such MLS workflows and show how they can be executed in a secure and correct manner. Our approach is based on semantic classification of the task dependencies that examines the source of the task dependencies. We classify the high-to-low dependencies in several ways: conflicting versus conflict-free, result-independent versus result-dependent, strong versus weak, and abortive versus non-abortive. W...
A Logic%2DBased Approach for Enforcing Access Control.

Temporal Authorization Bases From Specification to Integration.

Triggers in Java%2Dbased Databases.

An index allocation tool for object%2Doriented database systems.

Specifying and enforcing access control policies for XML document sources.

Specifying and computing hierarchies of temporal authorizations.

Protecting Information in the Web %2D Position Paper.

A Logical Framework for Reasoning on Data Access Control Policies.
In this paper we propose a logic formalism that naturally supports the encoding of complex security specifications. This formalism relies on a hierarchically structured domain made of subjects, objects and privileges.  Authorizations are expressed by logic rules. The formalism supports both negation by failure (possibly unstratified) and true negation. The latter is used to express negative authorizations. It turns out that conflicts may result from a set of authorization rules. Dealing with such conflicts requires the knowledge of the domain structure, such as grantor priorities and object/subject hierarchies, which is used in the deductive process to determine which authorization prevails, if any, on the others. Often, however, conflicts are unsolvable, as they express intrinsic ambiguities.  We have devised two semantics as an extension of the well-founded and the stable model semantics of logic programming. We have also defined a number of access policies, each based on two orthogo...
Approximation Techniques for Indexing Two%2DDimensional Constraint Databases.

Specifying and Computing Hierarchies of Temporal Authorizations.

An Approach to Classify Semi%2Dstructured Objects.
. Several advanced applications, such as those dealing with the Web, need to handle data whose structure is not known a-priori. Such requirement severely limits the applicability of traditional database techniques, that are based on the fact that the structure of data (e.g. the database schema) is known before data are entered into the database. Moreover, in traditional database systems, whenever a data item (e.g. a tuple, an object, and so on) is entered, the application species the collection (e.g. relation, class, and so on) the data item belongs to. Collections are the basis for handling queries and indexing and therefore a proper classication of data items in collections is crucial. In this paper, we address this issue in the context of an extended object-oriented data model. We propose an approach to classify objects, created without specifying the class they belong to, in the most appropriate class of the schema, that is, the class closest to the object state. In particular, w...
Inheritance in a Deductive Object Database Language with Updates.

Inheritance in a Deductive Object Database Language with Updates.

Indexing Constraint Databases by Using a Dual Representation.
Linear constraint databases are a powerful framework to model spatial and temporal data. The use of constraint databases should be supported by access data structures that make effective use of secondary storage and reduce query processing time. Such structures should be able to store both finite and infinite objects and perform both containment (ALL) and intersection (EXIST) queries. As standard indexing techniques have certain limitations in satisfying such requirements, we employ the concept of geometric duality for designing new indexing techniques. In [5], we have used the dual transformation for polyhedra to develop a dynamic optimal indexing solution based on B  +  -trees, to detect all objects contained in or intersecting a given halfplane, when the angular coefficient belongs to a predefined set. In this paper, we extend the previous solution to allow angular coefficients to take any value. We present two approximation techniques for the dual representation of spatial objects,...
CONCERTO%2C Conceptual Indexing%2C Querying and Retrieval of Digital Documents.

CONCERTO

Applying Data Mining Techniques to Wafer Manufacturing.
. In this paper we report an experience from the use of data  mining techniques in the area of semiconductor fabrication. The specic  application we dealt with is the analysis of data concerning the wafer  production process with the goal of determining possible causes for errors  in the production process, resulting in lots of faulty wafers. Even though  our application is very specic and deals with a specic manufacturing  sector (e.g. semiconductor fabrication), we believe that our experience  can be relevant to other manufacturing sectors and provide signicant  feedback on the use of data mining techniques.  1 Introduction  In this paper we report an experience from the use of data mining techniques in the area of semiconductor fabrication. The specic application we dealt with is the analysis of data concerning the wafer production process with the goal of determining possible causes for errors in the production process, resulting in lots of faulty wafers. Even though our appli...
A Temporal Object%2DOriented Data Model with Multiple Granularities.
In this paper we investigate some issues arising from the introduction of multiple temporal granularities in an objectoriented data model. Although issues concerning temporal granularities have been investigated in the context of temporal relational database systems, no comparable amount of work has been done in the context of object-oriented models. Moreover, the main drawback of the existing proposals is the lack of a formal basis -- which we believe is essential to manage the inherent complexity of the object-oriented data model. In this paper, we provide a complete temporal object-oriented type system supporting multiple temporal granularities and we formally define the set of legal values for our type system. We then address issues related to inheritance, type refinement and substitutability. 1. Introduction  Conventional database systems do not offer the possibility of dealing with time-varying data. The content of a database represents a snapshot of the reality in that only the ...
A Conceptual Annotation Approach to Indexing in a Web%2DBased Information System.
this paper, we propose to associate with the WWW objects not the nal conceptual
Controlled Access and Dissemination of XML Documents.
XML (eXtensible Markup Language) is becoming the most relevant standardization eort in the area of document representation through markup languages. Through XML, it is possible to dene complex documents, containing information at dierent degrees of sensitivity. Moreover, the processes of document exchange and acquisition, which canbevery frequent in Web-based information systems, are simplied and standardized. In this scenario, there is a strong need for policies to control and regulate the access and dissemination of XML documents. In the paper, we discuss main protection requirements posed by XML documents and we present a set of authorization and dissemination policies that enable both a controlled access to XML documents in a given source and the exchange of XML documents across dierent sources.  1 Introduction  XML (eXtensible Markup Language) [11] has recently emerged as the most relevant standardization eort in the area of document representation through markup languages i...
Review %2D An Authorization Mechanism for a Relational Data Base System.

A Flexible Authorization Mechanism for Relational Data Management Systems.
this article, we present an authorization model that can be used to express a number of discretionary access control policies for relational data management systems. The model permits both positive and negative authorizations and supports exceptions at the same time. The model is flexible in that the users can specify, for each authorization they grant, whether the authorization can allow for exceptions or whether it must be strongly obeyed. It provides authorization management for groups with exceptions at any level of the group hierarchy, and temporary suspension of authorizations. The model supports ownership together with decentralized administration of authorizations. Administrative privileges can also be restricted so that owners retain control over their tables.
The Specification and Enforcement of Authorization Constraints in Workflow Management Systems.
In recent years, workflow management systems (WFMSs) have gained popularity both in research as well as in commercial sectors. WFMSs are used to coordinate and streamline business processes of an organization. Often, very large WFMSs are used in organizations with users in the range of several thousands and number of process instances in the range of tens of thousands. To simplify the complexity of security administration, it is a common practice in many business organizations to allocate a role to perform each activity in the process and then assign one or more users to each role, and granting an authorization to roles rather than to users. Typically the security policies of the organization are expressed as constraints (or rules) on users and roles; a well-known constraint is separation of duties. Unfortunately, current role-based access control models are not adequate to model such constraints. To address this issue, in this paper, (1) we present a language to express both static an...
Modeling Spatio%2DTemporal Constraints for Multimedia Objects.

The Indispensability of Dispensable Indexes.

Finitely Representable Nested Relations.
this paper is the definition of a model and a query language for finitely representable nested relations, overcoming some limitations of the previous proposals. Our language is obtained by extending
Secure Object Deletion and Garbage Collection in Multilevel Object Bases.

Object%2DOriented Databases and Applications %2D Selected Papers from ICDE%2798.

Data Security.

Introducing External Functions in Constraint Query Languages.
. Constraint databases use constraints to model and query data. In particular, constraints allow a finite representation of infinite sets of relational tuples (also called generalized tuples). The choice of different logical theories to express constraints inside relational languages leads to the definition of constraint languages with different expressive power. Practical constraint database languages typically use linear constraints. This choice allows the use of efficient algorithms but, at the same time, some useful queries, needed by the considered application, may not be represented inside the resulting languages (for example, the convex hull cannot be computed [19]). These additional queries can only be modeled by changing the theory (thus, loosing the advantages of the linear theory), or extending the language, or using external functions. In this paper we consider the last approach and we propose an algebra and a calculus for constraint relational databases extended with exter...
Extending the ODMG Object Model with Time.
Although many temporal extensions of the relational data model have been proposed, there is no comparable amount of work in the context of object-oriented data models. Moreover, extensions to the relational model have been proposed in the framework of SQL standards, whereas no attempts have been made to extend the standard for object-oriented databases, defined by ODMG. This paper presents T ODMG, a temporal extension of the ODMG-93 standard data model. The main contributions of this work are, thus, the formalization of the ODMG standard data model and its extension with time. Another contribution of this work is the investigation, on a formal basis, of the main issues arising from the introduction of time in an object-oriented model.
Towards Optimal Indexing for Segment Databases.
 Segment databases store N non-crossing but possibly touching  segments in secondary storage. Efficient data structures have been  proposed to determine all segments intersecting a vertical line (stabbing  queries). In this paper, we consider a more general type of query for segment  databases, determining intersections with respect to a generalized  segment (a line, a ray, a segment) with a fixed angular coefficient. We  propose two solutions to solve this problem. The first solution has optimal   O(  N  B ) space complexity, where N is the database size and B is the  page size, but the query time is far from optimal. The second solution  requires O(  N  B log 2 B) space, the query time is O(log B  N  B (log B  N  B +log 2 B+  IL  (B)) +  T  B ), which is very close to the optimal, and insertion amortized  time is O(log B  N  B + log 2 B +  1  B log  2  B  N  B ), where T is the size of the  query result, and IL  (B) is a small constant, representing the number of  times we must repeatedly apply the log  function to B before the result  becomes  2.  
An Authorization Model and Its Formal Semantics.
Automated Reasoning (IJCAR’04). The workshop brought together researchers and practitioners from both the security and the automated reasoning communities, from academia and industry, who are working on developing and applying automated reasoning techniques and tools for the formal specification and analysis of security protocols. There were 18 submissions of high quality. All the submissions were thoroughly evaluated, and an electronic program committee meeting was held through the Internet. The program committee selected 9 research contributions which are included in this volume. The workshop program was enriched by an invited talk “Believing the Integrity of a System ” by Simon Foley, whose position paper is also included in this volume, and by two short presentations. We would like to thank the people who contributed to the organization of the ARSPA Workshop. We are grateful to: the other members of the organizing and program committee (namely David Basin, Jorge Cuellar, and Michaël Rusinowitch) and the additional referees, who allowed us to review the papers in a very short time while maintaining a very high standard (namely Rafael
Deadlock Detection in the Face of Transaction and Data Dependencies in Advanced Transaction Models.

Extending the ODMG Object Model with Composite Objects.
In this paper we extend the ODMG object data model with composite objects. A composite object is an object built by aggregating other component objects. Exclusiveness and dependency constraints, as well as referential integrity, can be associated with composition relationships among objects. Our composite object model is developed in the framework of the ODMG object database standard data model, but can be used in both object-oriented and object-relational database systems. In the paper, we propose a language for defining composite objects and we define the semantics of update operations on composite objects.  Keywords  Object-oriented database systems, composite objects, integrity constraints, data models. INTRODUCTION  Object-oriented DBMS (OODBMS) and object-relational DBMS (ORDBMS) are establishing themselves as the new generation DBMS. Object database systems overcome the limitations of relational systems with respect to several emerging data-intensive applications because of thei...
An Approach to Model and Query Event%2DBased Temporal Data.
Temporal database systems support all functions related to the management of large amounts of constantly changing data. However, current temporal database systems support a flat view of the history of data changes, in that all the changes are considered equally relevant and are, therefore, all stored in the database. However, many applications, such as monitoring and planning applications, call for more flexibility. Monitoring applications, in particular, may require that the history of a data item is stored only whenever a certain event occurs. For other applications the history of data changes may be less important than the event causing the changes. In this paper we propose an event-based temporal object model which allows to keep track of selected values within the history of a data object attribute. The portions, within the history of a data object, which are actually stored into the database are identified by relating them to events. In the paper, besides defining the data model,...
Active%2DU%2DDatalog Integrating Active Rules in a Logical Update Language.
Deductive database technology represents an important step  towards the goal of developing highly-declarative database programming  languages. In order to make deductive databases a practical technology,  deductive rules have to be extended to provide a dynamic behavior. In  particular, current applications require not only a support for updates  and transactions but also the ability to automatically react to the occurrence  of particular events. This is possible by integrating typical deductive  rules, whose execution is user-dependent, with active rules, whose  execution is event-dependent. Current solutions to this problem are not  completely satisfactory. In particular, they often lack a clear semantics,  guaranteeing termination, confluence and e#cient evaluation. The aim of  this paper is to propose a new language for integrating active rules, deductive  rules and updates in a uniform logical context. The language we  propose is based on the U-Datalog language [9], and extends it with support  for active rules, modeled according to the PARK semantics [23]. The  resulting language allows the representation of several dynamic aspects,  such as transaction execution, reactive behavior and update propagation,  in a uniform logical framework, admitting a clear and flexible semantics.
An Access Control Model Supporting Periodicity Constraints and Temporal Reasoning.
this paper, we present an access control model in which periodic temporal intervals are associated with authorizations. An authorization is automatically granted in the specified intervals and revoked when such intervals expire. Deductive temporal rules with periodicity and order constraints are provided to derive new authorizations based on the presence or absence of other authorizations in specific periods of time. We provide a solution to the problem of ensuring the uniqueness of the global set of valid authorizations derivable at each instant, and we propose an algorithm to compute this set. Moreover, we address issues related to the efficiency of access control by adopting a materialization approach. The resulting model provides a high degree of flexibility and supports the specification of several protection requirements that cannot be expressed in traditional access control models.
Exception%2DBased Information Flow Control in Object%2DOriented Systems.
this paper appeared under the title \Providing Flexibility in Information Flow Control for Object-Oriented Systems&#034; in the Proc. of the IEEE Symposium on Research in Security and Privacy, Oakland, CA, May 1997.
Data Security.

Advanced Transaction Processing in Multilevel Secure File Stores.
The concurrency control requirements for transaction processing in a multilevel secure le system are different from those in conventional transaction processing systems; in particular, there is the need to coordinate transactions at different security levels avoiding both potential timing covert channels and the starvation of transactions at high security levels. Suppose a transaction at a low security level attempts to write a data item that is being read by a transaction at a higher security level. On the one hand, a timing covert channel arises if the transaction at the low security level is either delayed or aborted by the scheduler. On the other hand, the transaction at the high security level may be subjected to an indefinite delay if it is forced to abort repeatedly. This paper extends the two-phase locking mechanism that is suitable for conventional transaction processing systems, to multilevel secure data management systems. The scheme presented here avoids the abort of higher level transactions, nonetheless guaranteeing serializability. The system programmer is provided with a powerful set of linguistic constructs which supports exception handling, partial rollback and forward
Temporal Synchronization Models for Multimedia Data.

Navigational Accesses in a Temporal Object Model.
The management of temporal data is a crucial requirement for many data intensive applications. A considerable research effort have been devoted in the past years to query languages for temporal data in the context of the relational model. Recently, temporal object-oriented data models have been proposed. In this paper, we focus on the navigational approach to querying object-oriented databases and show how this approach can be extended to a temporal context. In particular, we address issues related to the correctness of such navigational accesses.  1 Introduction temporal join -join timejoin  navigational Path expressions implicit joins explicit joins dangling  The importance of temporal data management has long been recognized by the database community and many techniques for modeling and managing temporal data have been introduced [19, 21]. Most research in temporal databases has been developed in the framework of the relational data model [8, 10, 17, 20]. However, also temporal obj...
An Extended Algebra for Constraint Databases.
Constraint relational databases use constraints to both model and query data. A constraint relation contains a finite set of generalized tuples. Each generalized tuple is represented by a conjunction of constraints on a given logical theory and, depending on the logical theory and the specific conjunction of constraints, it may possibly represent an infinite set of relational tuples. For their characteristics, constraint databases are well suited to model multidimensional and structured data, like spatial and temporal data. The definition of an algebra for constraint relational databases is important in order to make constraint databases a practical technology. In this paper, we extend the previously defined constraint algebra (called generalized relational algebra). First, we show that the relational model is not the only possible semantic reference model for constraint relational databases and we show how constraint relations can be interpreted under the nested relational model. Then...
Definition and Analysis of Index Organizations for Object%2DOriented Database Systems.
The efficient execution of queries in object-oriented databases requires the design of specific indexing techniques, to efficiently deal with predicates against nested attributes or against class inheritance hierarchies. Indexing techniques so far proposed can be classified into three groups: inheritance indexing techniques, whose goal is to support queries along inheritance hierarchies; aggregation indexing techniques, dealing with the efficient evaluation of nested predicates; integrated techniques. The aim of this paper is to analyze two techniques providing an integrated support, the path index and the nested-inherited index, with respect to traditional techniques, such as the multi-index and the inherited multi-index. The analysis is performed assuming that multi-valued attributes, as well as instances with null attribute values, are present in the database. For this purpose, the paper first presents the considered techniques. An extension of the path index, firstly defined in [6]...
A Formal Definition of the Chimera Object%2DOriented Data Model.

A Constraint%2DBased Approach to Shape Management in Multimedia Databases.

Mandatory Security and Object%2DOriented Systems A Multilevel Entity Model and its Mapping onto a Single%2DLevel Object Model.

Indexing Techniques for Advanced Database Systems

A flexible model supporting the specification and enforcement of role%2Dbased authorization in workflow management systems.
In recent years, workflow management systems (WFMSs) have gained popularity both in research as well as in commercial sectors. WFMSs are used to coordinate and streamline business processes of an organization. Often, very large WFMSs are used in organizations with users in the range of several thousands and number of process instances in the range of tens of thousands. To simplify the complexity of security administration, it is a common practice in many business organizations to allocate a role to perform each activity in the process and then assign one or more users to each role, and granting an authorization to roles rather than to users. Typically the security policies of the organization are expressed as constraints on users and roles. a well-known constraint is separation of duties. Unfortunately, current role-based access control models are not adequate to model such constraints. To address this issue, in this paper, (1) we present a language to express authorization constraints...
Integrity Constraint Checking in Chimera.

An Execution Model for Multilevel Seccure Workflows.

Administration Policies in a Multipolicy Autorization System.

A Principled Approach to Object Deletion and Garbage Collection in a Multi%2DLevel Secure Object Bases.

Trigger Inheritance and Overriding in Active Object Database Systems.
An active database is a database in which some operations are automatically executed when specified events happen and particular conditions are met. Several systems supporting active rules in an object-oriented data model have been proposed. However, several issues related to the integration of triggers with object-oriented modeling concepts have not been satisfactorily addressed. In this paper, we discuss issues related to trigger inheritance and refinement in the context of the Chimera active object-oriented data model. In particular, we introduce a semantics for an active object language that takes into account trigger inheritance and supports trigger overriding. Moreover, we state conditions on trigger overriding ensuring that trigger semantics is preserved in subclasses.
Providing flexibility in information flow control for object oriented systems.
This paper presents an approach to control information flow in object-oriented systems that takes into account, besides authorizations on objects, also how the information has been obtained and/or transmitted. These aspects are considered by allowing exceptions to the restrictions stated by the authorizations. Exceptions are specified by means of waivers associated with methods. Two kinds of waivers are supported: invoke-waivers, specifying exceptions applicable during a method&#039;s execution, and reply-waivers, specifying exceptions applicable to the information returned by a method. Information flowing from one object into another object is subject to the different waivers of the methods enforcing the transmission. We formally characterize information transmission and flow in a transaction taking into consideration different interaction modes among objects. We then define security specifications, meaning authorizations and waivers, and characterize safe information flows. We formally de...
A Unified Framework for Enforcing Multiple Access Control Policies.
Although several access control policies can be devised for controlling access to information, all existing authorization models, and the corresponding enforcement mechanisms, are based on a specific policy (usually the closed policy). As a consequence, although different policy choices are possible in theory, in practice only a specific policy can be actually applied within a given system. However, protection requirements within a system can vary dramatically, and no single policy may simultaneously satisfy them all. In this paper we present a flexible authorization manager (FAM) that can enforce multiple access control policies within a single, unified system. FAM is based on a language through which users can specify authorizations and access control policies to be applied in controlling execution of specific actions on given objects. We formally define the language and properties required to hold on the security specifications and prove that this language can express all security s...
Manipulating Spatial Data in Constraint Databases.
. Constraint databases have recently been proposed as a powerful framework to model and retrieve spatial data. In a constraint database, a spatial object is represented as a quantifier free conjunction of (usually linear) constraints, called generalized tuple. The set of solutions of such quantifier free formula represents the set of points belonging to the extension of the object. The relational algebra can be easily extended to deal with generalized relations. However, such algebra has some limitations when it is used for modeling spatial data. First of all, there is no explicit way to deal with the set of points representing a spatial object as a whole. Rather, only point-based computations can be performed using this algebra. Second, practical constraint database languages typically use linear constraints. This allows to use efficient algorithms but, at the same time, some interesting queries cannot be represented (for example, the distance between two objects cannot be computed). ...
Flexible Commit Protocols for Advanced Transaction Processing.

Query Processing.
Hardware for sensor nodes that combine physical sensors, actuators, embedded processors, and communication components has advanced significantly over the last decade, and made the large-scale deployment of such sensors a reality. Applications range from monitoring applications such as inventory maintenance over health care to military applications.
An Extended Authorization Model for Relational Databases.
... In this paper, we propose a novel approach to support multilevel access control in video databases. Our access control technique combines a video database indexing mechanism with a hierarchical organization of visual concepts (i.e., video database indexing units), so that different classes of users can access different video elements or even the same video element with different quality levels according to their permissions. These video elements, which, in our access control mechanism, are used for specifying the authorization objects, can be a semantic cluster, a subcluster, a video scene, a video shot, a video frame, or even a salient object (i.e., region of interest). In the paper, we first introduce our techniques for obtaining these multilevel 
On Modeling Cost Functions for Object%2DOriented Databases.

Information Flow Control in Object%2DOriented Systems.
this paper appeared under the title \Providing Flexibility in Information Flow Control for Object-Oriented Systems&#034; in the Proc. of the IEEE Symposium on Research in Security and Privacy, Oakland, CA, May 1997.
Transaction Processing in Multilevel Secure Databases with Kernelized Architectures Challenges and Solutions.

Transactions and Updates in Deductive Databases.
In this paper we develop a new approach providing a smooth integration of  extensional updates and declarative query language for deductive databases.  The approach is based on a declarative specification of updates in rule bodies.  Updates are not executed as soon are evaluated. Instead, they are collected  and then applied to the database when the query evaluation is completed.  We call this approach non-immediate update semantics. We provide a topdown  and equivalent bottom-up semantics which reflect the corresponding  computation models. We also package set of updates into transactions and we  provide a formal semantics for transactions. Then, in order to handle complex  transactions, we extend the transaction language with control constructors  still preserving formal semantics and semantics equivalence.  1  1 Introduction  In recentyears, deductive databases have been the focus of intense research, which has brought strong advances in theory, systems and applications. The major a...
Towards Optimal Two%2DDimensional Indexing for Constraint Databases.
We address the problem of indexing conjunctions of linear constraints with two variables. We show how containment and intersection selection problems for constraint databases can be reduced to the point location problem by using a dual transformation. The proposed representation is then used to develop an efficient secondary storage solution for one important particular indexing case. Key words: databases, data structures, computational geometry. 1 Introduction Constraint programming is very attractive from a database point of view because it is completely declarative and because often constraints represent the communication language of several high-level applications [5]. Constraints can be added to relational database systems at different levels. At the data level, quantifier free conjunctions of constraints finitely represent possibly infinite sets of relational tuples. Thus, constraints are a powerful mechanism for modeling spatial and temporal concepts, where often infinite inform...
Decentralized Administration for a Temporal Access Control Model.
In this report we present a temporal access control model that provides for decentralized administration of authorizations. Each access authorization, negative or positive, is associated with a time interval limiting its validity. When the interval expires, the authorization is automatically revoked. The model also permits the specification of rules, based on four different temporal operators, to derive additional authorizations from the presence or absence of other authorizations. Users creating objects can retain complete control over their objects or delegate other users the privilege of administering accesses on the objects. Delegation can also be selectively enforced with reference to specific access modes or time intervals. The resulting model provides a high degree of flexibility and allows to express several protection requirements which cannot be expressed in traditional access control models.  2  1 Introduction  Access control models available today allow the specification of...
A theoretical formulation for degrees of isolation in databases.
Although isolation is one of the desirable properties, most commercial database management systems do not provide complete isolation to transactions. They offer different degrees---0, 1, 2, or 3---of isolation, to transactions. By providing lower degrees of isolation, response time of a database system can be improved, although at the expense of consistency. Originally different degrees of isolation were defined in terms of lock-based protocols. This paper formulates these different degrees of isolation in terms of histories, as in the case of the usual serialization theory and proposes timestamp-based protocols for different degrees of isolation.  Keywords: Isolation, Serializability, Consistency, Locking protocols, Timestamp-ordering protocols  1 Introduction One of the key properties that transactions must preserve is isolation. In a shared database system, a completely isolated system gives the illusion to each transaction that it is being executed alone all by itself, even though...
T%5FChimera A Temporal Object%2DOriented Data Model.

A Formal View of Object%2DOriented Database Systems.

Computer Security %2D ESORICS 96
 A global public-key infrastructure (PKI), components of  which are emerging in the near future, is a prerequisite for security in  distributed systems and for electronic commerce. The purpose of this  paper is to propose an approach to modelling and reasoning about a  PKI from a user Alice&#039;s point of view. Her view, from which she draws  conclusions about the authenticity of other entities&#039; public keys and possibly  about the trustworthiness of other entities, consists of statements  about which public keys she believes to be authentic and which entities  she believes to be trustworthy, as well as a collection of certificates and  recommendations obtained or retrieved from the PKI. The model takes  into account recommendations for the trustworthiness of entities. Furthermore,  it includes confidence values for statements and can exploit  arbitrary certification structures containing multiple intersecting certification  paths to achieve a higher confidence value than for any single  c...
An Advanced Commit Protocol for MLS Distributed Database Systems.
The classical Early Prepare commit protocol (EP), used in many commercial systems, is not suitable for use in multilevel secure distributed database systems that employ a locking protocol for concurrency control. This is because EP requires that read locks be not released by a subtransaction during its window of uncertainty; however, it is not possible for a locking protocol to provide this guarantee in a multilevel secure system (since read lock of a higher level transaction on a lower level data object must be released whenever a lower level transaction wants to write it). The Secure Early Prepare protocol (SEP) overcomes this difficulty by aborting those distributed transactions that release their low level read locks prematurely. We see this approach as being too restrictive. One of the major benefits of distributed processing is its robustness to failures, and SEP fails to take advantage of this. In this work, we propose the Advanced Secure Early Prepare commit protocol (ASEP) tog...
A Non%2DTimestamped Authorization Model for Data Management Systems.

A Formal Temporal Object%2DOriented Data Model.
1 Introduction  A Formal Temporal Object-Oriented Data Model  Elisa Bertino Elena Ferrari Giovanna Guerrini  snapshot  tuple timestamping  attribute timestamping  bertino@hermes.mc.dsi.unimi.it, ferrarie@dsi.unimi.it  guerrini@disi.unige.it  Temporal databases are an active and fast growing research area. Although many extensions  to the relational data model have been proposed in order to incorporate time, there is no  comparable amount of work in the context of object-oriented data models. This paper presents  Chimera, a temporal extension of the Chimera object-oriented data model. The main contribution  of this work is to define a formal temporal object-oriented data model and to address  on a formal basis several issues deriving from the introduction of time in an object-oriented  context.  Dipartimento di Scienze dell&#039;Informazione - Universit`a di Milano  Via Comelico, 39/41 - I20133 Milano, Italy  Dipartimento di Informatica e Scienze dell&#039;Informazione - Universit`a di Genova  Vi...
A Graph%2DTheoretic Approach to Indexing in Object%2DOriented Databases.

Supporting Multiple Access Control Policies in Database Systems.
Although there are several choices of policies for protection of information, access control models have been developed for a fixed set pre-defined access control policies that are then built into the corresponding access control mechanisms. This becomes a problem, however, if the access control requirements of an application are different from the policies built into a mechanism. In most cases, the only solution is to enforce the requirements as part of the application code, but this makes verification, modification, and adequate enforcement of these policies impossible. In this paper, we propose a flexible authorization mechanism that can support different security policies. The mechanism enforces a general authorization model onto which multiple access control policies can be mapped. The model permits negative and positive authorizations, authorizations that must be strongly obeyed and authorizations that allow for exceptions, and enforces ownership together with delegation of admin...
Static Analysis of Intensional Databases in U%2DDatalog.

A decentralized temporal autoritzation model.

A Formal Representation for State Diagrams in the OMT Methodology.

On Using Materialization Strategies for a Temporal Authorization Model.
1 Introduction  Dipartimento di Scienze dell&#039;Informazione Universit`a di Milano Milano, Italy ferrarie@dsi.unimi.it Dipartimento di Scienze dell&#039;Informazione Universit`a di Milano Milano, Italy bertino@dsi.unimi.it Dipartimento di Scienze dell&#039;Informazione Universit`a di Milano Milano, Italy bettini@dsi.unimi.it Dipartimento di Scienze dell&#039;Informazione Universit`a di Milano Milano, Italy Dipartimento di Scienze dell&#039;Informazione Universit`a di Milano Milano, Italy samarati@dsi.unimi.it In this paper we show how materialization strategies can be successfully used for increasing the efficiency of access control in a temporal authorization model [BBFS96a]. The temporal authorization model allows to specify both temporal authorizations, that is, authorizations with an interval of validity, and derivation rules, allowing new authorizations to be derived on the basis of the presence or absence of other authorizations. These functionalities highly increase the expressive power of the model. ...
Supporting Periodic Authorizations and Temporal Reasoning in Database Access Control.
Several formal models for database access control have been proposed. However, little attention has been paid to temporal issues like authorizations with limited validity or obtained by deductive reasoning with temporal constraints. We present an access control model in which authorizations contain periodic temporal intervals of validity. An authorization is automatically granted in the time intervals specified by a periodic expression and revoked when such intervals expire. Deductive temporal rules with periodicity and order constraints are provided to derive new authorizations based on the presence or absence of other authorizations in specific periods of time. We prove the uniqueness of the set of implicit authorizations derivable at a given instant from the explicit ones, and we propose an algorithm to compute the global set of valid authorizations. The resulting model provides a high degree of flexibility and allows to express several protection requirements that cannot be express...
A Data Access Structure for Filtering Distance Queries in Image Retrieval.

A Temporal Access Control Mechanism for Database Systems.
This paper presents a discretionary access control model in which authorizations contain temporal intervals of validity. An authorization is automatically revoked when the associated temporal interval expires. The proposed model provides rules for the automatic derivation of new authorizations from those explicitly specified. Both positive and negative authorizations are supported. A formal definition of those concepts is presented in the paper, together with the semantic interpretation of authorizations and derivation rules as clauses of a general logic program. Issues deriving from the presence of negative authorizations are discussed. We also allow negation in rules: it is possible to derive new authorizations on the basis of the absence of other authorizations. The presence of this type of rules may lead to the generation of different sets of authorizations, depending on the evaluation order. An approach is presented, based on establishing an ordering among authorizations and deriv...
An Authorization Model for a Distributed Hypertext System.

Alternative Correctness Criteria for Concurrent Execution of Transactions in Multilevel Secure Databases.

On the Number of Descendants in an Object DAG.

Generalized Relational Algebra Modeling Spatial Queries in Constraint Databases.
The introduction of constraints in database languages is...
Enhanced Nested%2DInherited Index for OODBMS.

Providing Different Degrees of Recency Options to Transactions in Multilevel Secure Databases.

Panel Discussion Role%2DBased Access Control and Next%2DGeneration Security Models.

Objects with Multiple Most Specific Classes.
There are two main models of inheritance employed in object-oriented systems: class-based and object-based inheritance. Although classbased inheritance is beneficial for providing abstractions to encapsulate, classify and structure objects, it is too rigid to deal with the dynamic and unanticipated incremental modifications required in application domains where the functionality of objects is supposed to evolve. In contrast, object-based inheritance is particularly suitable in situations where the dynamic evolution of objects is desired, but this is achieved at the expense of an object model which does not maintain the encapsulation property. In this paper, we propose a new approach for supporting evolving objects while preserving the advantages of the class-based model. The approach is based on maintaining the object-class separation of the class-based model and on introducing an additional abstraction level between objects and their class. The new abstraction relaxes the static objec...
Database Monitoring in U%2DDatalog.

Query Decomposition in an Object%2DOriented Database System Distributed on a Local Area Network.

Semantic Assumptions and Query Evaluation in Temporal Databases.
When querying a temporal database, a user often makes certain semantic assumptions on stored temporal data. This paper formalizes and studies two types of semantic assumptions: point-based and interval-baaed, The point-based assumptions include those assumptions that use interpolation methods, while the interval-based assumptions include those that involve different temporal types (time granularities). Each assumption is viewed as a way to derive certain implicit data from the explicit data stored in the database. The database system must use all explicit as well as (possibly infinite) implicit data to answer user queries. This paper introduces a new method to facilitate such query evaluations. A user query is translated into a system query such that the answer of this system query over the explicit data is the same as that of the user query over the explicit and the implicit data. The paper gives such a translation procedure and studies the properties (safety in particular) of user queries and system queries. 1
Index Organizations for Object%2DOriented Database Systems.
The efficient execution of queries in object-oriented databases requires the design of specific indexing techniques, to efficiently deal with predicates against nested attributes or against class inheritance hierarchies. Indexing techniques so far proposed can be classified into three groups: inheritance indexing techniques, whose goal is to support queries along inheritance hierarchies; aggregation indexing techniques, dealing with the efficient evaluation of nested predicates; integrated techniques. The aim of this paper is to analyze two techniques providing an integrated support, the path index and the nested-inherited index, with respect to traditional techniques, such as the multi-index and the inherited multi-index. The analysis is performed assuming that multi-valued attributes, as well as instances with null attribute values, are present in the database. For this purpose, the paper first presents the considered techniques. An extension of the path index, firstly defined in [6]...
Database Security Research and Practice

An Extended Authorization Model for Object Databases.

Towards Deductice Object Databases.

Object%2DOriented Methodologies and Systems
The effective management of IS-related processes requires measuring the functional size of information systems. Functional size measurement is usually performed using the Function Points Analysis method. Earlier attempts to apply Function Point counting rules to object-oriented systems met with serious problems because the implicit model of functional user requirements in Function Points Analysis is hard to reconcile with the object-oriented paradigm. The emergence of a new generation of functional size measurement methods has changed this picture. The main implementation of this generation, COSMIC Full Function Points, explicitly defines a generic model of functional user requirements onto which artifacts belonging to any IS specification or engineering methodology can be mapped. In this paper we present specific COSMIC-FFP mapping rules for methodologies that take an event-based approach to information system engineering. In particular we show that the event-oriented nature of the COSMIC-FFP measurement rules provides for a natural mapping of concepts. To illustrate the mapping rules we use MERODE, a formal event-based object-oriented methodology for systems development in information processing intensive domains. The mapping rules presented are confined to the enterprise layer in a MERODE IS architecture. 1.
A Temporal Authorization Model.
1 Introduction  Dipartimento di Scienze dell&#039;Informazione Universit`a di Milano Milano, Italy ferrarie@dsi.unimi.it Dipartimento di Scienze dell&#039;Informazione Universit`a di Milano Milano, Italy bertino@dsi.unimi.it Dipartimento di Scienze dell&#039;Informazione Universit`a di Milano Milano, Italy bettini@dsi.unimi.it Dipartimento di Scienze dell&#039;Informazione Universit`a di Milano Milano, Italy Dipartimento di Scienze dell&#039;Informazione Universit`a di Milano Milano, Italy samarati@dsi.unimi.it In this paper we show how materialization strategies can be successfully used for increasing the efficiency of access control in a temporal authorization model [BBFS96a]. The temporal authorization model allows to specify both temporal authorizations, that is, authorizations with an interval of validity, and derivation rules, allowing new authorizations to be derived on the basis of the presence or absence of other authorizations. These functionalities highly increase the expressive power of the model. ...
A new Authorization Model for Object%2DOriented Databases.

Degrees of Isolation%2C Concurrency Control Protocols%2C and Commit Protocols.

Deductive Object Databases.
This paper proposes a new approach to model deductive object databases. Each object  database is described by means of a Datalog language extended with extensional updates, called  U-Datalog. Objects can change state and cooperate. We introduce an extension of U-Datalog  to approach the problem of composition among object databases. It can be used for modular  database design and for cooperation among deductive objects. The resulting language has a  clear semantics for the evolution of objects and for modeling the transactional behavior of the  resulting database. Finally, we describe some architectural issues of the prototype which has  been developed.
Mark%2Dand%2DSweep Garbage Collection in Multilevel Secure Object%2DOriented Database Systems.

A Bottom%2DUp Interpreter for a Database Language with Updates and Transactions.
Deductive databases with updates in rule bodies do not allow bottom-up execution model. This is due to the introduction of control in rule bodies. However, bottom-up execution models are very important due to the set oriented queryanswering process of database systems. In [4] we have proposed a rule language to avoid the above drawback and to provide transaction optimization through transaction transformation. In this paper we describe a prototype that provide a bottom-up meta interpreter for the database rule language and will allow to check the validity of future extensions theoretical conjecture about transaction optimization and integrity constraints. The experience in the use of KBMS1 as a tool to develop a run time support for the rule language is reported together with an overview of the system architecture.   This work has been supported by a grant from the Italian National Research Council.  y  The work of D. Montesi has been partly supported by the ERCIM fellowship Informatio...
On the Selection of Optimal Index Configuration in OO Databases.
An operation in object-oriented databases gives rise to the processing of a path. Several database operations may result into the same path. We address the problem of optimal index configuration for a single path. As it will be shown an optimal index configuration for a path can be achieved by splitting the path into subpaths and by indexing each subpath with the optimal index organization. We present an algorithm which is able to select an optimal index configuration for a given path. For the moment we consider a limited number of existing indexing techniques (simple index, inherited index, nested inherited index, multi-index, and multiinherited index) but the principles of the algorithm will remain the same adding more indexing techniques.  1 Introduction  Object-oriented data models are based on some fundamental concepts which will be discussed briefly. A real world entity is represented by an object. Each object is uniquely identified by an object identifier (oid) which is supposed...
Generic Methods in Deductive Object Databases.

Transaction Optimization in Rule Databases.
f g ! ! ! LDL  Cause Effect 1 Introduction  ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ;  E. Bertino B. Catania G. Guerrini D. Montesi  Transaction Optimization in Rule Databases bertino,catania,guerrini @disi.unige.it cause effect query update update query update update query query B 1 Bn H B 1 Bn INS 1 INS k DEL k 1 DEL t H INS 1 INS k DEL k 1 DEL t B 1 Bn H B 1 Bn  In the tradition of declarative rules (which we will follow) the above rule is represented as . . . . A first version of the language has been implemented as part of a project at the University of Genova.  This paper proposes an approach to transaction optimization in rule databases. It is based on a new technique to express updates in rule languages based on a non-immediate update execution. This technique is used to statically characterize some properties of the rules and transactions. Those properties are used at run-time to detect and remove redundant /complementary updates which are useless, hence increasing the efficiency of tra...
Index Configurations in Object%2DOriented Databases.

Static Analysis of Transactional Intensional Databases.
E. Bertino  1  , B. Catania  1  , G. Guerrini  2  , D. Montesi  3 1  Dipartimento di Scienze dell&#039;Informazione, Universit`a di Milano Via Comelico, 39 20133 Milano, Italy  fbertino,cataniag@disi.unige.it  2  Dipartimento di Informatica e Scienze dell&#039;Informazione, Universit`a di Genova Viale Benedetto XV, 3 16132 Genova, Italy  guerrini@disi.unige.it  3  Informatics Department, Systems Engineering Division Rutherford Appleton Laboratory, SERC Chilton, Didcot, Oxon OX11 0QX, UK  danilo@inf.rl.ac.uk Abstract  This paper proposes a formal framework to statically analyze intensional databases modeling transactional behavior. The considered language is U-Datalog, an extension of Datalog modeling updates and transactions. The analysis, performed at compile time, provides information about certain types of situations that may arise at execution time such as aborts, inconsistencies and failures. These information can be used to check the correctness of the database and to optimize transactions...
An Approach to Authorization Modeling in Object%2DOriented Database Systems.

Clustering Techniques in Object Bases A Survey.

Guest Editors%27 Introduction.

Applications of Object%2DOriented Technology to the Integration of Heterogeneous Database Systems.

Index Configuration in Object%2DOriented Databases

Object%2DOriented Database Systems
This paper attempts to define an object-oriented database system. It describes the main features and characteristics that a system must have to qualify as an objectoriented database system. We have separated these characteristics into three groups: ffl Mandatory, the ones the system must satisfy in order to be termed an objectoriented database system. These are complex objects, object identity, encapsulation, types or classes, inheritance, overriding combined with late binding, extensibility, computational completeness, persistence, secondary storage management, concurrency, recovery and an ad hoc query facility. ffl Optional, the ones that can be added to make the system better, but which are not mandatory. These are multiple inheritance, type checking and inferencing, distribution, design transactions and versions. ffl Open, the points where the designer can make a number of choices. These are the programming paradigm, the representation system, the type system, and uniformity. We...
Authorizations in Relational Database Management Systems.

Access Control in Object%2DOriented Database Systems %2D Some Approaches and Issues.

High Assurance Discretionary Access Control for Object Bases.

Access Control in Object%2DOriented Database Systems %2D Some Approaches and Issues.

Queries%2C Constraints%2C Updates and Transactions Within a Logic%2DBased Language.

Achieving Stricter Correctness Requirements in Multilevel Secure Databases The Dynamic Case.

Modeling Multilevel Entities Using Single Level Objects.

Formalizzazione e Ottimizzazione di Transazioni di modifica in CLP%28AD%29.

An Advanced Information Management System.
Introduction  The term data security refers to the protection of information against possible violations that can compromise its secrecy (or confidentiality), integrity , or availability . Secrecy is compromised if information is disclosed to users not authorized to access it. Integrity is compromised if information is improperly modified, deleted, or tampered. Availability is compromised if users are prevented from accessing data for which they have the necessary permissions. This last problem is also known as denial-of-service.  The problem of protecting information has existed since information has been managed. However, as technology advances and information management systems become more and more powerful, the problem of enforcing information security also becomes more critical. The increasing development of information technology in the past few years, which has led to the widespread use of compute
Research Issues in Discretionary Authorizations for Object Bases.

Enforcing Mandatory Access Control in Object Bases.

Path%2DIndex An Approach to the Efficient Execution of Object%2DOriented Queries.

Achieving Stricter Correctness Requirements in Multilevel Secure Database Management Systems.

An Approach to Integrate Multimedi Data in a Knowledge Representation System.

Towards a Logical%2DObject Oriented Programming Language for Databases.

CLP %28X%29 as a framework for action and deduction.

A View Mechanism for Object%2DOriented Databases.
We propose the notions of virtual schemas and virtual bases as a coherent way of integrating various features in OODB views. A virtual schema is defined based on some existing (real) schema. A virtual base is obtained when a (real) base is attached to a virtual schema. We study the consequences of this simple assumption. In particular, we observe the differences between a real schema and a virtual one. We also consider an extension (that we call generic schemas) where it is necessary to specify several real bases to attach data to a virtual schema. We show how the flexibility provided by virtual schemas can be used to cope with various dynamic features of database systems. 1 Introduction Views are intended to increase the flexibility of database systems and their definition in the object-oriented database (OODB) context comes as a natural extension of the original paradigm. The yet relatively young research on this topic has introduced a large variety of indispensable new features. H...
Towards a Logical%2DObject Oriented Programming Language for Databases.

CLP%28AD%29 as a Deductive Database Language with Updates.

Modelling Database Updates with Constraint Logic Programming.

Multimedia Data Handling in a Knowledge Representation System.

The ADKMS Knowledge Acquisition System.

Data Hiding and Security in Object%2DOriented Databases.

A Knowledge Based Information System.
In traditional document clustering models, a document is considered as a bag of words. In this paper we present a new method for generating feature vectors, using the sentence fragments that are called logical terms and  statements, in PLIR system. PLIR is a Knowledge-Based Information system based on the theory of the Plausible Reasoning. We have conducted a number of experiments using OHSUMED document collection and the clustering methods K-Means with seven different similarity measures between documents. The Experiments seem to indicate that the use of richer features such as logical terms or statements for clustering tends to perform better than the simp le bag of words approaches within our domain of experiments that is second phase of a twostage retrieval system.
An Analytical Model of Object%2DOriented Query Costs.

Optimization of Object%2DOriented Queries Using Path Indices.

An Approach to Support Method Invocations in Object%2DOriented Queries.

Modeling Database Updates with Constraint Logic Programming.

Query optimization by using knowledge about data semantics.

Object%2DOriented Query Languages The Notion and the Issues.

Method precomputation in object%2Doriented databases.

An Indexing Technique for Object%2DOriented Databases.
Object Oriented Database systems (OODBs) need efficient indexing techniques just like other Database systems. However, B -trees which work very well for Relational Database systems are not good enough for OODBs. Several alternate indexing techniques have been proposed, amongst them H-trees. This report analyses indexing techniques for OODBs, in particular H-trees. Contents 1 Introduction 4 2 CH-trees 5 3 S-trees 6 4 H-trees 10 4.1 Structure : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 10 4.2 Nesting : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 11 5 H-trees : Implementation Details 13 5.1 Node Headers : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 13 5.2 Build : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 14 5.3 Search : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 15 5.4 Insert : : : : : : : : : : : : : : : : : : : : : : ...
Integration of Heterogeneous Data Repositories by Using Object%2DOriented Views.

A Survey of Indexing Techniques for Object%2DOriented Database Management Systems.

A Model of Authorization for Next%2DGeneration Database Systems.

Object%2DOriented Database Management Systems Concepts and Issues.
The concept of providing transparent access to a collection of files in a mass storage system is a familar one. The goal of this project was to investigate the feasibility of providing similar access to a collection of persistent, complex objects.
Design and Development of a Document Management System for Banking Applikations an Example of Office Automation.

Optimization of Queries using Nested Indices.

Composite Objects Revisted.

Indexing Techniques for Queries on Nested Objects.

Integration of heterogeneous database applications through an object%2Doriented interface.

Views and Security in Distributed Database Management Systems.

MULTOS a Document Server for Distributed Office Systems.

The COMANDOS Integration System An Object Oriented Approach to the Interconnection of Heterogeneous Applications.

Query Processing in a Multimedia Document System.

Correctness of Semantic Integrity Checking in Database Management Systems.

The Effects of Two%2DPhase Locking on the Performance of a Distributed Database Management System.

An Evaluation of Precompilation and Interpretation in Distributed Database Management Systems.

Query Processing Based on Complex Object Types.

Development of a Multimedia Information System for an Office Environment.

Distributed Database Design Using the Entity%2DRelationship Model.

The Update Problem in the Distributed Database System Hermes%2F1.

Performance Evaluation of Two%2DPhase Locking Algorithms in a System for Distributed Databases.

View Management in Distributed Data Base Systems.

R%2A A Research Project on Distributed Relational DBMS.

Performance Evaluation of Two Concurrency Control Mechanisms in a Distributed Database System.

